This is not the latest version of this item. The latest version can be found here.
Counting solutions to polynomial systems via reductions
Name
OASIcs-SOSA-2018-6.pdf
Description
Published version
Size
553.1 KB
Format
Adobe PDF
Checksum (MD5)
f8781ce98b1dbc64ac4c56d771c13517
Date Issued
January 2018
Journal
OpenAccess Series in Informatics
Citation
2018. "Counting solutions to polynomial systems via reductions." OpenAccess Series in Informatics, 61.
Version
Final published version
Abstract
© Richard Ryan Williams. This paper provides both positive and negative results for counting solutions to systems of polynomial equations over a finite field. The general idea is to try to reduce the problem to counting solutions to a single polynomial, where the task is easier. In both cases, simple methods are utilized that we expect will have wider applicability (far beyond algebra). First, we give an efficient deterministic reduction from approximate counting for a system of (arbitrary) polynomial equations to approximate counting for one equation, over any finite field. We apply this reduction to give a deterministic poly(n, s, log p)/ϵ2 -time algorithm for approximately counting the fraction of solutions to a system of s quadratic n-variate polynomials over Fp (the finite field of prime order p) to within an additive ϵ factor, for any prime p. Note that uniform random sampling would already require Ω(s/ϵ2) time, so our algorithm behaves as a full derandomization of uniform sampling. The approximate-counting algorithm yields efficient approximate counting for other well-known problems, such as 2-SAT, NAE-3SAT, and 3-Coloring. As a corollary, there is a deterministic algorithm (with analogous running time) for producing solutions to such systems which have at least ϵpn solutions. Second, we consider the difficulty of exactly counting solutions to a single polynomial of constant degree, over a finite field. (Note that finding a solution in this case is easy.) It has been known for over 20 years that this counting problem is already NP-hard for degree-three polynomials over F2; however, all known reductions increased the number of variables by a considerable amount. We give a subexponential-time reduction from counting solutions to k-CNF formulas to counting solutions to a degree-kO(k) polynomial (over any finite field of O(1) order) which exactly preserves the number of variables. As a corollary, the Strong Exponential Time Hypothesis (even its weak counting variant #SETH) implies that counting solutions to constant-degree polynomials (even over F2) requires essentially 2n time. Similar results hold for counting orthogonal pairs of vectors over Fp.
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
10.4230/OASIcs.SOSA.2018.6
