Author:
Schöning Uwe,Pruim Randall
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Two remarks on the power of counting, Proceedings of the 6th GI Conference in Theoretical Computer Science, Lecture Notes in Computer Science 145, Springer, 1983, 269-276.
2. E. Allender: Invertible Functions, PhD thesis, Georgia Tech., 1985
3. J. Cai, L.A. Hemachandra: On the power of parity polynomial time, Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 349, Springer, 1989, 229-240
4. U. Schoning: Probabilistic complexity classes and lowness, Journal of Computer and Systems Sciences 39 (1989), 84–100.
5. L.G. Valiant, V.V. Vazirani: NP is as easy as detecting unique solutions, Theoretical Computer Science 47 (1986), 85–93.