Abstract
With the help of the BP· operator, Toda (1989) achieved an astonishing result: the classes ⊕P and #P are, in a sense, at least as expressive as the entire polynomial hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
E. Allender: Invertible Functions, PhD thesis, Georgia Tech., 1985
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
U. Schoning: Probabilistic complexity classes and lowness, Journal of Computer and Systems Sciences 39 (1989), 84–100.
L.G. Valiant, V.V. Vazirani: NP is as easy as detecting unique solutions, Theoretical Computer Science 47 (1986), 85–93.
S. Toda: PP is as hard as the polynomial-time hierarchy, SI AM Journal on Computing 20 (1991), 865–877.
C.H. Papadimitriou: Computational Complexity, Addison-Wesley, 1994, page 450
R. Beigel, J. Tarui: On ACC, Proceedings of the Symposium on Foundations of Computer Science, IEEE 1991, 783-792.
J. Kobler, S. Toda: On the power of generalized MOD-classes, Mathematical Systems Theory 29 (1994), 33–46.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). The BP-Operator and the Power of Counting Classes. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive