Abstract
Jin-Yi Cai is one of the top researchers in complexity theory. Jin-Yi is one of the greatest pure problem solvers that I have had the pleasure to work with. He has solved a number of famous open problems, starting with his thesis work under the great Juris Hartmanis, continuing with his work on several long-standing complexity conjectures, and more recently extending the beautiful work of Leslie Valiant on holographic computation [129].
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). Easy and Hard Sums. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_26
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7155-5_26
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)