Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem   The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to
solve. So far, EqSatz by Li is the only solver which can solve this problem.
However, This solver is very slow. It is reported that it spent 11855 seconds
to solve a par32-5 instance on a Maxintosh G3 300 MHz. The paper introduces a
new solver, XORSAT, which splits the original problem into two parts:
structured part and random part, and then solves separately them with WalkSAT
and an XOR equation solver. Based our empirical observation, XORSAT is
surprisingly fast, which is approximately 1000 times faster than EqSatz. For a
par32-5 instance, XORSAT took 2.9 seconds, while EqSatz took 2844 seconds on
Intel Pentium IV 2.66GHz CPU. We believe that this method significantly
different from traditional methods is also useful beyond this domain.

3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph