INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
9781441971548
NATIONAL BIBLIOGRAPHY NUMBER
Country Code
IR
Number
EN-54221
LANGUAGE OF THE ITEM
.Language of Text, Soundtrack etc
انگلیسی
COUNTRY OF PUBLICATION OR PRODUCTlON
Country of publication
IR
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
The P=NP question and Geodel's lost letter
General Material Designation
[Book]
First Statement of Responsibility
/ Richard J. Lipton
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
New York.
Name of Publisher, Distributor, etc.
: Springer,
Date of Publication, Distribution, etc.
, c2010.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
xiii, 239 p. , ill. , 24 cm.
NOTES PERTAINING TO PUBLICATION, DISTRIBUTION, ETC.
Text of Note
Electronic
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references (p. 229-233) and index.
CONTENTS NOTE
Text of Note
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 Geodel'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.
Text of Note
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. Geodel lost letter.
OTHER VARIANT TITLES
Variant Title
P equals NP question and Geodel's lost letter
TOPICAL NAME USED AS SUBJECT
Geodel's theorem
Computational complexity
Computer algorithms
Logic, Symbolic and mathematical
LIBRARY OF CONGRESS CLASSIFICATION
Class number
E-BOOK
PERSONAL NAME - PRIMARY RESPONSIBILITY
Lipton, Richard J.
PERSONAL NAME - SECONDARY RESPONSIBILITY
Geodel, Kurt
ORIGINATING SOURCE
Country
ایران
ELECTRONIC LOCATION AND ACCESS
Host name
9781441971548.pdf
Access number
عادی
Compression information
عادی
Date and Hour of Consultation and Access
9781441971548.pdf
Electronic Format Type
متن
old catalog
e
BL
1
a
Y
