Abstract
A pivotal flaw in Vinay Deolalikar’s claimed proof of P not equal to NP, the subject of the opening chapter, was an incorrect assertion about closure under projections. The great Henri Lebesgue erred on the same score over a century ago. This chapter contrasts Deolalikar’s situation with a famous complexity lower bound in which closure under projections does hold, namely the Baur-Strassen theorem discussed previously in Chap. 13.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lipton, R.J., Regan, K.W. (2013). Henri Lebesgue: Projections Are Tricky. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-41422-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41421-3
Online ISBN: 978-3-642-41422-0
eBook Packages: Computer ScienceComputer Science (R0)