Time-space tradeoffs for counting NP solutions modulo integers

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 70-82

  Williams, Ryan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BRANCH AND BOUND METHOD; INTEGER PROGRAMMING; PROBLEM SOLVING; TIME DOMAIN ANALYSIS;

DETERMINISTIC COMPUTATIONS; LOWER BOUNDS; MODULO SMALL INTEGERS; RESTRICTED SPACES;

COMPUTATIONAL COMPLEXITY;

EID: 34748867982     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.34     Document Type: Conference Paper

References (35)

1. E. Allender and V. Gore. A uniform circuit lower bound for the permanent. SIAM J Comput. 23:1026-1049, 1994.
2. E. Allender. The Permanent Requires Large Uniform Threshold Circuits. Chicago Journal of Theoretical Computer Science, article 7, 1999.
3. E. Allender, M. Kouck, D. Ronneburger, S. Roy, and V. Vinay. Time-Space Tradeoffs in the Counting Hierarchy. In IEEE Conference on Computational Complexity, 295-302, 2001.
4. D. Barrington, H. Straubing, and D. Therien. Nonuniform automata over groups. Information and Computation 89(2):109-132, 1990.
5. R. Beigel, H. Buhrman, and L. Fortnow. NP might not be as easy as detecting unique solutions. In Proc. ACM STOC, 203-208, 1998.
6. R. Beigel and J. Gill. Counting classes: thresholds, parity, mods, and fewness. Theoretical Computer Science 103(1):3-23, 1992.
7. C. H. Bennett. Time-space tradeoffs for reversible computation. SIAM J. Comput. 18:766-776, 1989.
8. H. Buhrman, J. Tromp, and P. Vitanyi. Time and Space Bounds for Reversible Simulation. J. Phys. A: Math Gen. 34:6821-6830, 2001.
9. J.-Y. Cai and L. A. Hemachandra. On the power of parity polynomial time. In Proc. Symposium on Theoretical Aspects of Computer Science (STACS), Springer LNCS 349, 229-240, 1989.
10. J.-Y. Cai and V. Choudhary. Some Results on Matchgates and Holographic Algorithms. In Proc. of ICALP Vol. 1, Springer-Verlag LNCS, 703-714, 2006.
11. J.-Y. Cai and P. Lu. Bases Collapse in Holographic Algorithms. To appear in Proc. IEEE Conference on Computational Complexity, 2007.
12. H. Caussinus, P. McKenzie, D. Therien and H. Vollmer. Nondeterministic NC1 Computation. J Comput. Syst. Sci. 57(2):200-212, 1998.
13. A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. JACM 28(1):114-133, 1981.
14. m gates. In Proc. IEEE FOCS, 2006.
15. S. Diehl and D. van Melkebeek. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. SIAM J Comput. 36: 563-594, 2006.
16. L. Fortnow. Nondeterministic Polynomial Time Versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. In Proc. IEEE Conference on Computational Complexity, 52-60, 1997.
17. L. Fortnow, R. Lipton, D. Van Melkebeek, and A. Viglas. Time-Space Lower Bounds for Satisfiability. JACM 52(6):835-865, 2005.
18. L. Fortnow and D. van Melkebeek. Time-Space Tradeoffs for Nondeterministic Computation. In Proc. IEEE Conference on Computational Complexity, 2-13, 2000.
19. V. Grolmusz. A Degree-Decreasing Lemma for (MOD-q - MOD-p) Circuits. Disc. Math, and Theor. Comp. Sci. 4(2):247-254, 2001.
20. S. Gupta. Isolating an Odd Number of Elements and Applications in Complexity Theory. Theory of Computing Systems 31:27-40, 1998.
21. R. Kannan. Alternation and the power of nondeterminism. In Proceedings of ACM STOC, 344-346, 1983.
22. R. Kannan. Towards Separating Nondeterminism from Determinism. Mathematical Systems Theory 17(1):29-45, 1984.
23. A. Klivans and D. Van Melkebeek. Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SIAM J. Comput. 31:1501-1526, 2002.
24. R. J. Lipton and A. Viglas. On the Complexity of SAT. In Proceedings of IEEE FOCS, 459-464, 1999.
25. W. Maass and A. Schorr. Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape. SIAM J Comput. 16(1): 195-202, 1987.
26. A. V. Naik, K. W. Regan, D. Sivakumar. On quasilinear-time complexity theory. Theoretical Computer Science 148:325-349, 1995.
27. V. Nepomnjascii. Rudimentary predicates and Turing calculations. Soviet Math Doklady 11:1462-1465, 1970.
28. S. Toda and M. Ogiwara. Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21(2):316-328, 1992.
29. W Paul, N. Pippenger, E. Szemeredi, and W. Trotter. On determinism versus nondeterminism and related problems. In Proc. IEEE FOCS, 429-438, 1983.
30. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. ACM STOC, 77-82, 1987.
31. I. Tourlakis. Time-Space Tradeoffs for SAT on Nonuniform Machines. J. Computer and System Sciences 63(2): 268-287, 2001.
32. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. TCS 47(1):85-93, 1986.
33. L. Valiant. Holographic algorithms. In Proc. IEEE FOCS, 306-315, 2004.
34. L. Valiant. Accidental algorithms. In Proc. IEEE FOCS, 509-517, 2006.
35. R. Williams. Better Time-Space Lower Bounds for SAT and Related Problems. In Proc. IEEE Conference on Computational Complexity, 40-49, 2005.