Order Total (1 Item Items):
Shipping Destination:
Np Completeness Basics Computational Complexity by Goldreich Oded (22 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (22)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (16)
- As New, Fine or Near Fine (3)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (6)
- Not Print on Demand (18)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Condition: good. Fast & Free Shipping â" Good condition with a solid cover and clean pages. Shows normal signs of use such as light wear or a few marks highlighting, but overall a well-maintained copy ready to enjoy. Supplemental items like CDs or access codes may not be included.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
First Edition
Condition: Very Good. 1st Edition. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
US$ 57.35
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
US$ 56.01
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Condition: New.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
US$ 64.81
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity.
Published by Cambridge University Press, New York, 2010
US$ 25.00
Convert currencyUS$ 19.60 shipping from Israel to U.S.A.Quantity: 1 available
Add to basket230X155 mm. XXIX+184 pages. Softcover. Cover corners slightly wrinkled. In good condition. The book is in : English.
-
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 66.39
Convert currencyUS$ 16.18 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press 2010-10-21, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
US$ 61.97
Convert currencyUS$ 20.93 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 64.20
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 72.91
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 84.87
Convert currencyUS$ 33.77 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 1st edition. 240 pages. 9.06x5.98x0.55 inches. In Stock.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 052119248X ISBN 13: 9780521192484
Language: English
US$ 147.25
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
US$ 92.34
Convert currencyUS$ 72.17 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: 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.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 052119248X ISBN 13: 9780521192484
Language: English
Condition: New.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 052119248X ISBN 13: 9780521192484
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 170.59
Convert currencyUS$ 16.18 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 223.19
Convert currencyUS$ 33.77 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 052119248X ISBN 13: 9780521192484
Language: English
US$ 293.61
Convert currencyUS$ 33.77 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 0521122546 ISBN 13: 9780521122542
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 64.21
Convert currencyUS$ 13.58 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 330.
-
US$ 59.40
Convert currencyUS$ 33.77 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Brand New. 1st edition. 240 pages. 9.06x5.98x0.55 inches. In Stock. This item is printed on demand.
-
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by Cambridge University Press, 2010
ISBN 10: 052119248X ISBN 13: 9780521192484
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 180.73
Convert currencyUS$ 15.20 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 450.
-
US$ 174.21
Convert currencyUS$ 33.77 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. This item is printed on demand.
