Abstract
Lenore Blum is a computer scientist who is now at Carnegie-Mellon University. She is famous for her work with Steve Smale and Michael Shub on the “The P=NP Question Over The Reals” [18]. This important work shows that there is a version of P=NP for computations over the real numbers. Also she is one of the national leaders in helping get more women more involved in Computer Science. Finally, she is part of the most well known family in all of computer science: her husband, Manny Blum, is a Turing Award winner, and her son, Avrim Blum, is one of best researchers in the world in machine learning.
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
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). Algorithms: Tiny Yet Powerful. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7155-5_2
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)