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 49,30
EUR 3,41 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 : 0521122546
ISBN 13 : 9780521122542
Ancien ou d'occasion
Couverture souple
Edition originale
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Very Good. 1st Edition. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. N° de réf. du vendeur 18411334-75
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
P, Np, and Np-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Ancien ou d'occasion
Couverture souple
Vendeur : ZBK Books, Carlstadt, NJ, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : good. Fast & Free Shipping â" Good condition with a solid cover and clean pages. Shows normal signs of use such as light wear or a few marks highlighting, but overall a well-maintained copy ready to enjoy. Supplemental items like CDs or access codes may not be included. N° de réf. du vendeur ZWV.0521122546.G
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 : 0521122546
ISBN 13 : 9780521122542
Neuf
Couverture souple
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580244147
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
P, NP, and NP-Completeness : The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Neuf
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 9287651-n
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 : 0521122546
ISBN 13 : 9780521122542
Neuf
Couverture souple
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 9780521122542
Quantité disponible : 2 disponible(s)
Image d'archives
P, Np, and Np-Completeness: The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Neuf
Couverture souple
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9780521122542
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
P, NP, and NP-Completeness : The Basics of Computational Complexity
Edité par
Cambridge University Press, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 9287651
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, NP, and NP-Completeness (Paperback)
Edité par
Cambridge University Press, Cambridge, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Neuf
Paperback
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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 9780521122542
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 : 0521122546
ISBN 13 : 9780521122542
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 330. N° de réf. du vendeur C9780521122542
Quantité disponible : Plus de 20 disponibles
Image d'archives
P, NP, and NP-Completeness
Edité par
Cambridge University Press CUP, 2010
ISBN 10 : 0521122546
ISBN 13 : 9780521122542
Neuf
Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 216. N° de réf. du vendeur 261795464
Quantité disponible : 4 disponible(s)