论文信息 - Two remarks on the power of counting - 字舞流文

Two remarks on the power of counting

Christos H. Papadimitriou | Stathis Zachos | C. Papadimitriou | S. Zachos

[1] Christos H. Papadimitriou,et al. On the complexity of unique solutions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.

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

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

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

[6] Janos Simon,et al. On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

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

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