Computational Complexity - Christos Papadimitriou - Books - Pearson Education (US) - 9780201530827 - November 30, 1993
In case cover and title do not match, the title is correct

Christos Papadimitriou
Computational Complexity

Get an email once the item is available
Do you have a profile? Log in

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, and more.

500 pages, notes, references

Media Books     Paperback Book   (Book with soft cover and glued back)
Released November 30, 1993
Original release date 1994
ISBN13 9780201530827
Publishers Pearson Education (US)
Pages 544
Dimensions 171 × 246 × 30 mm   ·   802 g

More by Christos Papadimitriou

Show all

See all of Christos Papadimitriou ( e.g. Paperback Book )