Two remarks on the power of counting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 145 LNCS, Issue , 1982, Pages 269-275

  Papadimitriou, Christos H ^a   Zachos, Stathis K ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Counting problems; Machine simulation; Oracle computation; Parity problems; Polynomial hierarchy

Indexed keywords

POLYNOMIAL APPROXIMATION; POLYNOMIALS; TURING MACHINES;

COUNTING PROBLEMS; IDEMPOTENT; MACHINE SIMULATION; PARITY PROBLEMS; POLYNOMIAL ALGORITHM; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME;

PROBLEM SOLVING;

EID: 85034738925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036487     Document Type: Conference Paper

References (10)

1. D. Angluin “On counting problems and the polynominal-time hierarchy”, Theoretical Computer Science 12 (1980), pp. 161-173.
2. M.R. Garey, D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.
3. J. Gill “Computational complexity of probabilistic Turing machines”, SIAM J. Computing 6 (1977), pp. 675-695.
4. H.R. Lewis, C.H. Papadimitriou Elements of the Theory of Computation, Prentice-Hall, 1981.
5. C.H. Papadimitriou “The complexity of unique solutions”, Proc. 13th FOCS Conference, 1982, to appear.
6. C.H. Papadimitriou, M. Yannakakis “The complexity of facets and some facets of complexity”, Proc. 14th STOC, pp. 255-260, 1982. Also to appear in JCSS.
7. J. Simon “On the difference between one and many” Proc. 4th Intern. Colloguium on Automata, Languages and Programming, pp. 480-491, 1977.
8. L.J. Stockmeyer “The polynamial-time hierarchy”, Theoretical Computer Science, 3 (1977), pp. 1-22.
9. L.G. Valiant “The complexity of computing the permanent”, Theoretical Computer Science, 8 (1979), pp. 181-201.
10. L.G. Valiant, private communication, August 1982.