008 |
|
100825s2010 mau s j eng d |
020 |
|
|a9781441971555 (electronic bk.)
|
020 |
|
|a9781441971548 (paper)
|
050 |
04
|
|aQA267.7|b.L57 2010
|
082 |
04
|
|a511.3|222
|
090 |
|
|aQA267.7|b.L767 2010
|
100 |
1
|
|aLipton, Richard J.
|
245 |
14
|
|aThe P=NP question and Godel's lost letter|h[electronic resource] /|cby Richard J. Lipton.
|
260 |
|
|aBoston, MA :|bSpringer Science+Business Media, LLC,|c2010.
|
300 |
|
|axiii, 239 p. :|bill., digital ;|c24 cm.
|
650 |
0
|
|aComputational complexity.
|
650 |
14
|
|aComputer Science.
|
650 |
24
|
|aTheory of Computation.
|
650 |
24
|
|aMathematics of Computing.
|
650 |
24
|
|aHistory of Computing.
|
650 |
24
|
|aMathematical Logic and Foundations.
|
650 |
24
|
|aAlgorithm Analysis and Problem Complexity.
|
650 |
24
|
|aAlgorithms.
|
710 |
2
|
|aSpringerLink (Online service)
|
773 |
0
|
|tSpringer eBooks
|
856 |
40
|
|uhttp://dx.doi.org/10.1007/978-1-4419-7155-5
|
950 |
|
|aComputer Science (Springer-11645)
|