Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: New Worst-Case Upper Bound for #XSAT   An algorithm running in O(1.1995n) is presented for counting models for exact
satisfiability formulae(#XSAT). This is faster than the previously best
algorithm which runs in O(1.2190n). In order to improve the efficiency of the
algorithm, a new principle, i.e. the common literals principle, is addressed to
simplify formulae. This allows us to eliminate more common literals. In
addition, we firstly inject the resolution principles into solving #XSAT
problem, and therefore this further improves the efficiency of the algorithm.

3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn