Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
Zustand: Very Good. 1st Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Artikel-Nr. 18411334-75
Anzahl: 1 verfügbar
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Paperback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Artikel-Nr. GOR009345147
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9780521122542_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 1st edition. 240 pages. 9.06x5.98x0.55 inches. In Stock. Artikel-Nr. x-0521122546
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 2010. 1st Edition. Paperback. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Num Pages: 216 pages, 18 b/w illus. 94 exercises. BIC Classification: UYA. Category: (UU) Undergraduate. Dimension: 228 x 156 x 13. Weight in Grams: 336. The Basics of Computational Complexity. 214 pages, 18 b/w illus. 94 exercises. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Cateogry: (UU) Undergraduate. BIC Classification: UYA. Dimension: 228 x 156 x 13. Weight: 330. . . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521122542
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9780521122542
Anzahl: 1 verfügbar
Anbieter: Wonder Book, Frederick, MD, USA
Zustand: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp. Artikel-Nr. P07R-00414
Anzahl: 1 verfügbar