Abstract
Some of the concepts introduced in the previous chapters like Turing reducibility or the games between a Prover and a Verifier, can be interpreted as different ways to study the complexity of a problem supposing that one can get some external “help” or information. In the case of the Turing reducibility this external help is the information contained in an oracle set or function, while in the case of games between a Prover and a Verifier, the external information can be anything the Prover sends.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Circuits and Sparse Sets. In: The Graph Isomorphism Problem. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0333-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0333-9_5
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