|
|
|
|
| LEADER |
04292nam a22005295i 4500 |
| 001 |
9249 |
| 003 |
DE-He213 |
| 005 |
20130725201546.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100825s2010 xxu| s |||| 0|eng d |
| 020 |
# |
# |
|a 9781441971555
|9 978-1-4419-7155-5
|
| 024 |
7 |
# |
|a 10.1007/978-1-4419-7155-5
|2 doi
|
| 050 |
# |
4 |
|a QA75.5-76.95
|
| 072 |
# |
7 |
|a UY
|2 bicssc
|
| 072 |
# |
7 |
|a UYA
|2 bicssc
|
| 072 |
# |
7 |
|a COM014000
|2 bisacsh
|
| 072 |
# |
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 100 |
1 |
# |
|a Lipton, Richard J.
|e author.
|
| 245 |
1 |
4 |
|a The P=NP Question and Gd̲el<U+0019>s Lost Letter
|c by Richard J. Lipton.
|h [electronic resource] /
|
| 264 |
# |
1 |
|a Boston, MA :
|b Springer US,
|c 2010.
|
| 300 |
# |
# |
|a XIII, 239p. 20 illus.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 505 |
0 |
# |
|a Part I A Prologue -- A Walk In the Snow -- Part II On the P=NP Question -- Algorithms: Tiny Yet Powerful -- Is P=NP Well Posed? -- What Would You Bet? -- What Happens What P=NP Is Resolved? -- NP Too Big or P Too Small? -- How To Solve P=NP? -- Why Believe P Not Equal To NP? -- A Nightmare About SAT -- Bait and Switch -- Who<U+0019>s Afraid of Natural Proofs? -- An Approach To P=NP -- Is SAT Easy? -- SAT is Not Too Easy -- Ramsey<U+0019>s Theorem and NP -- Can They Do That? -- Rabin Flips a Coin -- A Proof We All Missed -- Barrington Gets Simple -- Exponential Algorithms -- An EXPSPACE Lower Bound -- Randomness has Unbounded Power -- Counting Cycles and Logspace -- Ron Graham Gives a Talk -- An Approximate Counting Method -- Easy and Hard Sums -- How To Avoid O-Abuse -- How Good is The Worst Case Model? -- Savitch<U+0019>s Theorem -- Adaptive Sampling and Timed Adversaries -- On The Intersection of Finite Automata -- Where are the Movies? -- Part III On Integer Factoring -- Factoring and Factorials -- BDD<U+0019>s -- Factoring and Fermat -- Part IV On Mathematics -- A Curious Algorithm -- Edit Distance -- Protocols -- Erds̳ and the Quantum Method -- Amplifiers -- Amplifying on the PCR Amplifier -- Mathematical Embarrassments -- Mathematical Diseases -- Mathematical Surprises -- A Gd̲el Lost Letter -- Index.
|
| 520 |
# |
# |
|a The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved. The P=NP Question and Gd̲el<U+0019>s Lost Letter covers historical developments (including the Gd̲el<U+0019>s Lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at http://rjlipton.wordpress.com. Jin-Yi Cai, a professor in computer science at the University of Wisconsin remarks 'I think it is the single most interesting web blog I have seen on related topics. He has a great insight and wit and beautiful way to see things and explain them.' Richard DeMillo, a professor in computer science at Georgia Tech remarks, 'This is a much needed treatment of great open problem computing.' The P=NP Question and Gd̲el<U+0019>s Lost Letter is designed for advanced level students and researchers in computer science, and mathematics as a secondary text and reference book. Computer programmers, software developers and IT professionals working in the related industry of computer science theory, will also find this guide a valuable asset.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Information theory.
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Algorithms.
|
| 650 |
# |
0 |
|a Logic, Symbolic and mathematical.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a History of Computing.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9781441971548
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4419-7155-5
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|