Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Efficiency of Solving Boolean Polynomial Systems with the
  Characteristic Set Method   An improved characteristic set algorithm for solving Boolean polynomial
systems is proposed. This algorithm is based on the idea of converting all the
polynomials into monic ones by zero decomposition, and using additions to
obtain pseudo-remainders. Three important techniques are applied in the
algorithm. The first one is eliminating variables by new generated linear
polynomials. The second one is optimizing the strategy of choosing polynomial
for zero decomposition. The third one is to compute add-remainders to eliminate
the leading variable of new generated monic polynomials. By analyzing the depth
of the zero decomposition tree, we present some complexity bounds of this
algorithm, which are lower than the complexity bounds of previous
characteristic set algorithms. Extensive experimental results show that this
new algorithm is more efficient than previous characteristic set algorithms for
solving Boolean polynomial systems.

21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math
28
The categories of this paper are: alg-geom