Articles liés à P, NP, and NP-Completeness: The Basics of Computational...
Synopsis
The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 121,59
EUR 7,63 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour P, NP, and NP-Completeness: The Basics of Computational...
Image d'archives
P, NP, and NP-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9780521192484
Quantité disponible : 1 disponible(s)
Image d'archives
P, NP, and NP-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580247138
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, NP, and NP-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9780521192484
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, NP, and NP-Completeness (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780521192484
Quantité disponible : 1 disponible(s)
Image d'archives
P, NP, and NP-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521192484_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, NP, and NP-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 450. N° de réf. du vendeur C9780521192484
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, Np, and Np-completeness: The Basics of Computational Complexity
Edité par
Cambridge Univ Pr, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __052119248X
Quantité disponible : 1 disponible(s)
Image d'archives
P, NP, and NP-Completeness (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780521192484
Quantité disponible : 1 disponible(s)
Image d'archives
P, NP, and NP-Completeness (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2010
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521192484
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
P, NP, and NP-Completeness
Edité par
Cambridge University Press, 2015
ISBN 10 : 052119248X
ISBN 13 : 9780521192484
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, alg. N° de réf. du vendeur 446929503
Quantité disponible : Plus de 20 disponibles