Np completeness basics computational complexity von goldreich oded (29 Ergebnisse)

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.

paperback. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

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.

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. …

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New.

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: Brand New. 1st edition. 240 pages. 9.06x5.98x0.55 inches. In Stock.

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. …

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.

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.…

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. . . . . . …

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Hardcover. Zustand: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock.

Hardcover. Zustand: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock.

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

230X155 mm. XXIX+184 pages. Softcover. Cover corners slightly wrinkled. In good condition. The book is in : English.

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Taschenbuch. Zustand: Neu. P, NP, and NP-Completeness | The Basics of Computational Complexity | Oded Goldreich | Taschenbuch | Kartoniert / Broschiert | Englisch | 2012 | Cambridge University Press | EAN 9780521122542 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.…

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.