Abstract
Ken Regan is a great theorist, and probably the best chess player in the world who can correctly state what P=NP means. Certainly, the best who can give the proof Toda’s Theorem.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-1-4419-7155-5_45
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lipton, R.J. (2010). Counting Cycles and Logspace. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_23
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7155-5_23
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-7154-8
Online ISBN: 978-1-4419-7155-5
eBook Packages: Computer ScienceComputer Science (R0)