omitir hasta el contenido
The P=NP question and Gödel's lost letter Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

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

Autor: Richard J Lipton; Kurt Gödel
Editorial: New York. : Springer, ©2010.
Edición/Formato:   Libro impreso : Inglés (eng)Ver todas las ediciones y todos los formatos
Resumen:
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  Leer más
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de material: Recurso en Internet
Tipo de documento Libro, Recurso internet
Todos autores / colaboradores: Richard J Lipton; Kurt Gödel
ISBN: 9781441971548 1441971548
Número OCLC: 671868992
Descripción: xiii, 239 pages : illustrations ; 24 cm
Contenido: 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.
Otros títulos: P equals NP question and Gödel's lost letter
Responsabilidad: Richard J. Lipton.
Más información:

Resumen:

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  Leer más

Reseñas

Reseñas editoriales

Resumen de la editorial

"This book is a thoroughly enjoyable read because ofthe great balance between anecdotes, presentations of `nice' problems andalgorithms and their solutions and proofs, `hard mathematics,' and musings Leer más

 
Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.
Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


Primary Entity

<http://www.worldcat.org/oclc/671868992> # The P=NP question and Gödel's lost letter
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "671868992" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:about <http://dewey.info/class/511.3/e22/> ;
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://id.worldcat.org/fast/949806> ; # Gödel's theorem
    schema:about <http://id.worldcat.org/fast/1002068> ; # Logic, Symbolic and mathematical
    schema:alternateName "P equals NP question and Gödel's lost letter" ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/97851774> ; # Kurt Gödel
    schema:copyrightYear "2010" ;
    schema:creator <http://viaf.org/viaf/117513630> ; # Richard J. Lipton
    schema:datePublished "2010" ;
    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: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:exampleOfWork <http://worldcat.org/entity/work/id/657106808> ;
    schema:inLanguage "en" ;
    schema:name "The P=NP question and Gödel's lost letter"@en ;
    schema:productID "671868992" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/671868992#PublicationEvent/new_york_springer_2010> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/657106808#Agent/springer> ; # Springer
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy1208/2010932770-t.html> ;
    schema:workExample <http://worldcat.org/isbn/9781441971548> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB0B9747> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/671868992> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York.
    a schema:Place ;
    schema:name "New York." ;
    .

<http://id.worldcat.org/fast/1002068> # Logic, Symbolic and mathematical
    a schema:Intangible ;
    schema:name "Logic, Symbolic and mathematical"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/949806> # Gödel's theorem
    a schema:Intangible ;
    schema:name "Gödel's theorem"@en ;
    .

<http://viaf.org/viaf/117513630> # Richard J. Lipton
    a schema:Person ;
    schema:familyName "Lipton" ;
    schema:givenName "Richard J." ;
    schema:name "Richard J. Lipton" ;
    .

<http://viaf.org/viaf/97851774> # Kurt Gödel
    a schema:Person ;
    schema:familyName "Gödel" ;
    schema:givenName "Kurt" ;
    schema:name "Kurt Gödel" ;
    .

<http://worldcat.org/isbn/9781441971548>
    a schema:ProductModel ;
    schema:isbn "1441971548" ;
    schema:isbn "9781441971548" ;
    .


Content-negotiable representations

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.