The complexity of approximate counting

There are several computational problems that can be formulated as problems of counting the number of objects having a certain property. Valiant [22] has introduced the class #P which includes a variety of counting problems such as counting the number of perfect matchings in a graph, computing the permanent of a matrix [22], finding the size of a backtrack search tree [14], and computing the probability that a network remains connected when links can fail with a certain probability [23]. We define and study a class of restricted, but very natural, probabilistic sampling methods motivated by the particular counting problems mentioned above. Instead of “singleton sampling” the algorithm is allowed to sample a large set S ample; U in one step; the information returned from the sample is whether S contains any element having the property being counted. We attempt to classify the complexity of computing approximate solutions to problems in #P. The classification is done in terms of the polynomial-time hierarchy (for short, P-hierarchy) [21]. We give a relativization result that complements a recent result of Sipser and Gaacute;c [19] that BPP is contained in the second level of the P-hierarchy.

[1]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[2]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[3]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .

[4]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[5]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[6]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[7]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[8]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[10]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[11]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[12]  Udi Manber,et al.  Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version) , 1982, STOC '82.

[13]  Udi Manber,et al.  Probabilistic, Nondeterministic, and Alternating Decision Trees , 1982, STOC 1982.

[14]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[15]  Uzi Vishkin,et al.  A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Leslie M. Goldschlager,et al.  An approximation algorithm for computing the permanent , 1980 .

[17]  Richard J. Lipton,et al.  Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..

[18]  Michael Sipser,et al.  Borel sets and circuit complexity , 1983, STOC.

[19]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[20]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Dana Angluin,et al.  On Counting Problems and the Polynomial-Time Hierarchy , 1980, Theor. Comput. Sci..

[23]  Uzi Vishkin,et al.  A complexity theory for unbounded fan-in parallelism , 1982, FOCS 1982.