Articoli correlati a P, NP, and NP-Completeness: The Basics of Computational...
Sinossi
Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 110,34
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per P, NP, and NP-Completeness: The Basics of Computational...
Immagini fornite dal venditore
P, NP, and NP-Completeness
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: 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. Codice articolo 446929503
Quantità: Più di 20 disponibili
Foto dell'editore
P, NP, and NP-Completeness: The Basics of Computational Complexity
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780521192484
Quantità: Più di 20 disponibili
Foto dell'editore
P, NP, and NP-Completeness: The Basics of Computational Complexity
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521192484_new
Quantità: Più di 20 disponibili
Foto dell'editore
P, Np, and Np-completeness: The Basics of Computational Complexity
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. This item is printed on demand. Codice articolo __052119248X
Quantità: 1 disponibili
Foto dell'editore
P, NP, and NP-Completeness: The Basics of Computational Complexity
Print on DemandDa: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 450. Codice articolo C9780521192484
Quantità: Più di 20 disponibili
Foto dell'editore
P, NP, and NP-Completeness (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2010
ISBN 10: 052119248X
ISBN 13: 9780521192484
Nuovo
Rilegato
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521192484
Quantità: 1 disponibili
Foto dell'editore
P, NP, and NP-Completeness (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2010
ISBN 10: 052119248X
ISBN 13: 9780521192484
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521192484
Quantità: 1 disponibili
Foto dell'editore
P, NP, and NP-Completeness: The Basics of Computational Complexity
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580247138
Quantità: Più di 20 disponibili
Foto dell'editore
P, Np, and Np-completeness: The Basics of Computational Complexity
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. Codice articolo x-052119248X
Quantità: 2 disponibili
Immagini fornite dal venditore
P, NP, and NP-Completeness
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Codice articolo 9780521192484
Quantità: 1 disponibili