컨텐츠로 이동
The P=NP question and Gödel's lost letter 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

The P=NP question and Gödel's lost letter

저자: Richard J Lipton; Kurt Gödel
출판사: New York. : Springer, ©2010.
판/형식:   도서 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
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 Gö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  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Richard J Lipton; Kurt Gödel
ISBN: 9781441971548 1441971548
OCLC 번호: 671868992
설명: xiii, 239 p. : ill. ; 24 cm.
내용: 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. Gödel lost letter.
다른 제목 P equals NP question and Gödel's lost letter
책임: Richard J. Lipton.
더 많은 정보:

초록:

The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. This guide, originating from a weblog written by the author, covers  더 읽기…

리뷰

편집자의 리뷰

출판사 줄거리

From the reviews: "This book ... collects and edits the highlights from Lipton's ongoing blog, rounded out by cross-references and a useful index and bibliography. ... the book offers a different 더 읽기…

 
사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/671868992>
library:oclcnum"671868992"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/671868992>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1002068>
rdf:typeschema:Intangible
schema:name"Logic, Symbolic and mathematical"@en
schema:name"Logic, Symbolic and mathematical."@en
schema:contributor
schema:copyrightYear"2010"
schema:creator
schema:datePublished"2010"
schema: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. Gödel lost letter."@en
schema: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 Gö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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/657106808>
schema:inLanguage"en"
schema:name"P equals NP question and Gödel's lost letter"@en
schema:name"The P=NP question and Gödel's lost letter"@en
schema:numberOfPages"239"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.