Verwandte Artikel zu P, NP, and NP-Completeness Hardback: The Basics of...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 251,09
EUR 28,88 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 122,28
EUR 7,67 für den Versand innerhalb von/der USA
Versandziele, Kosten & Dauer
Suchergebnisse für P, NP, and NP-Completeness Hardback: The Basics of...
Beispielbild für diese ISBN
P, NP, and NP-Completeness: The Basics of Computational Complexity
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9780521192484
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness: The Basics of Computational Complexity
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2215580247138
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness: The Basics of Computational Complexity
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9780521192484
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2010
ISBN 10: 052119248X
ISBN 13: 9780521192484
Neu
Hardcover
Anbieter: Grand Eagle Retail, Mason, OH, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 9780521192484
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness: The Basics of Computational Complexity
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9780521192484_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness: The Basics of Computational Complexity
Print-on-DemandAnbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 450. Bestandsnummer des Verkäufers C9780521192484
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
P, Np, and Np-completeness: The Basics of Computational Complexity
Print-on-DemandAnbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. This item is printed on demand. Bestandsnummer des Verkäufers __052119248X
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2010
ISBN 10: 052119248X
ISBN 13: 9780521192484
Neu
Hardcover
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 9780521192484
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
P, NP, and NP-Completeness (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2010
ISBN 10: 052119248X
ISBN 13: 9780521192484
Neu
Hardcover
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 9780521192484
Anzahl: 1 verfügbar
Foto des Verkäufers
P, NP, and NP-Completeness
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 446929503
Anzahl: Mehr als 20 verfügbar