Library of Congress |

Library of Congress

Matches in Library of Congress for { <http://lccn.loc.gov/2010932770> ?p ?o. }

Showing items 1 to 31 of 31 with 100 items per page.

2010932770 abstract "The P=NP question is one of the greatest 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. This book covers historical developments (including the Gödel'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 -- Back cover.".
2010932770 alternative "P equals NP question and Gödel's lost letter".
2010932770 contributor B12092860.
2010932770 contributor B12092861.
2010932770 created "c2010.".
2010932770 date "2010".
2010932770 date "c2010.".
2010932770 dateCopyrighted "c2010.".
2010932770 description "Includes bibliographical references (p. 229-233) and index.".
2010932770 description "Part I. A prologue. -- A walk in the snow -- Part II. On the P=NP question. -- Algorithms: tiny yet powerful -- Is P=NP posed? -- What would you bet? -- What happens when 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's afraid of natural proofs? -- An approach to P=NP -- Is SAT easy? -- SAT is not too easy -- Ramsey'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'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's -- Factoring and Fermat -- Part IV. On mathematics. -- A curious logorithm -- Edit distance -- Protocols -- Erdos and the Quantum Method -- Amplifiers -- Amplifying on the PCR amplifier -- Mathematical embarrassments -- Mathematical diseases -- Mathematical surprises -- Erratum A. Gödel lost letter.".
2010932770 description "The P=NP question is one of the greatest 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. This book covers historical developments (including the Gödel'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 -- Back cover.".
2010932770 extent "xiii, 239 p. :".
2010932770 identifier "1441971548".
2010932770 identifier "9781441971548".
2010932770 identifier 2010932770-b.html.
2010932770 identifier 2010932770-d.html.
2010932770 identifier 2010932770-t.html.
2010932770 issued "2010".
2010932770 issued "c2010.".
2010932770 language "eng".
2010932770 publisher "New York. : Springer,".
2010932770 subject "511.3 22".
2010932770 subject "Computational complexity.".
2010932770 subject "Computer algorithms.".
2010932770 subject "Gödel's theorem.".
2010932770 subject "Logic, Symbolic and mathematical.".
2010932770 subject "QA9.65 .L57 2010".
2010932770 tableOfContents "Part I. A prologue. -- A walk in the snow -- Part II. On the P=NP question. -- Algorithms: tiny yet powerful -- Is P=NP posed? -- What would you bet? -- What happens when 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's afraid of natural proofs? -- An approach to P=NP -- Is SAT easy? -- SAT is not too easy -- Ramsey'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'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's -- Factoring and Fermat -- Part IV. On mathematics. -- A curious logorithm -- Edit distance -- Protocols -- Erdos and the Quantum Method -- Amplifiers -- Amplifying on the PCR amplifier -- Mathematical embarrassments -- Mathematical diseases -- Mathematical surprises -- Erratum A. Gödel lost letter.".
2010932770 title "P equals NP question and Gödel's lost letter".
2010932770 title "The P=NP question and Gödel's lost letter / Richard J. Lipton.".
2010932770 type "text".