Abstract
Zeke Zalcstein worked, before he retired a few years ago, on the boundary between mathematics and computational complexity. He started his career in mathematics, and then Zeke moved into computational complexity. His Ph.D. advisor was John Rhodes, who is an expert on many things, including the structure of semigroups; Rhodes has recently worked on the P=NP question himself.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-1-4419-7155-5_45
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lipton, R.J. (2010). A Curious Algorithm. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_36
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7155-5_36
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)