Skip to content

Computational Complexity

Best in textbook rentals since 2012!

ISBN-10: 0201530821

ISBN-13: 9780201530827

Edition: 1994

Authors: Christos Papadimitriou

List price: $179.99
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. 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, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes,…    
Customers also bought

Book details

List price: $179.99
Copyright year: 1994
Publisher: Pearson Education
Publication date: 11/30/1993
Binding: Paperback
Pages: 544
Size: 6.75" wide x 9.75" long x 1.25" tall
Weight: 1.848
Language: English

Admitted to Columbia University when he was 15, Apostolos Doxiadis has studied mathematics at both undergraduate and graduate level. An internationally recognised expert on the subjects of mathematics and narrative, he has also worked in film and theatre, and is the author of the international bestseller Uncle Petros and Goldbach's Conjecture .

Algorithms
Problems and Algorithms
Turing Machines
Undecidability
Logic
Boolean Logic
First Order Logic
Undecidability in Logic
P and NP
Relations between Complexity Classes
Reductions and Completeness
NP-Complete Problems
coNP and Function Problems
Randomized Computation
Cryptography
Approximability
On P vs. NP
Inside P
Parallel Computation
Logarithmic Space
Beyond NP
The Polynomial Hierarchy
Computation That Counts
Polynomial Space
A Glimpse Beyond