A Note on Enumarative Counting

Resolving an open question about the complexity of enumerative approximation, we show that if [num]SAT has a polynomial-time nk-enumerator, then P = P[num]P.

[1]  Janos Simon.  On some central problems in computational complexity , 1975 .

[2]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[4]  Jin-Yi Cai,et al.  Enumerative Counting Is Hard , 1989, Inf. Comput..

[5]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[6]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[7]  Juris Hartmanis.  Solvable problems with conflicting relativizations , 1985, Bull. EATCS.

[8]  Amihood Amir,et al.  Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[9]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[10]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[11]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

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

[14]  Eric Allender,et al.  Oracles versus Proof Techniques that Do Not Relativize , 1990, SIGAL International Symposium on Algorithms.

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

[16]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[17]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.