Abstract
We have seen that the complexity class NP can be characterized in terms of an existential quantifier followed by a polynomial time predicate. This idea can be generalized to characterize other complexity classes.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Köbler, J., Schöning, U., Torán, J. (1993). Quantifiers, Games, and Interactive Proofs. In: The Graph Isomorphism Problem. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0333-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0333-9_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6712-6
Online ISBN: 978-1-4612-0333-9
eBook Packages: Springer Book Archive