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: Bahamut Media, Reading, Vereinigtes Königreich
Hardcover. Zustand: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. Artikel-Nr. 6545-9780521192484
Anzahl: 1 verfügbar
Anbieter: AwesomeBooks, Wallingford, Vereinigtes Königreich
Hardcover. Zustand: Very Good. P, NP, and NP-Completeness: The Basics of Computational Complexity This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. Artikel-Nr. 7719-9780521192484
Anzahl: 2 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. GB-9780521192484
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. GB-9780521192484
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780521192484_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Speedyhen, Hertfordshire, Vereinigtes Königreich
Zustand: NEW. Artikel-Nr. NW9780521192484
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. Artikel-Nr. __052119248X
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: New. 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. Artikel-Nr. 446929503
Anzahl: 1 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 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 152 x 16. Weight in Grams: 490. . 2010. Hardback. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521192484
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. Artikel-Nr. x-052119248X
Anzahl: 2 verfügbar