Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Counting Solutions to Binomial Complete Intersections   We study the problem of counting the total number of affine solutions of a
system of n binomials in n variables over an algebraically closed field of
characteristic zero. We show that we may decide in polynomial time if that
number is finite. We give a combinatorial formula for computing the total
number of affine solutions (with or without multiplicity) from which we deduce
that this counting problem is #P-complete. We discuss special cases in which
this formula may be computed in polynomial time; in particular, this is true
for generic exponent vectors.

21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph