Picture 1 of 1

Stock photo

Computational Complexity - Picture 1 of 1

Computational Complexity by Christos Papadimitriou (1993, Trade Paperback)

LeeBeeBooks (82)

90.2% positive feedback

Price:

$83.24

+ $5.22 shipping

Estimated delivery Fri, Aug 29 - Sat, Sep 6

Returns:

30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

Computational Complexity

About this product

Product Identifiers

PublisherPearson Education

ISBN-100201530821

ISBN-139780201530827

eBay Product ID (ePID)11776

Product Key Features

Number of Pages544 Pages

Publication NameComputational Complexity

LanguageEnglish

SubjectMachine Theory, Computer Science

Publication Year1993

TypeTextbook

AuthorChristos Papadimitriou

Subject AreaComputers

FormatTrade Paperback

Dimensions

Item Height1.2 in

Item Weight27.2 Oz

Item Length9.1 in

Item Width6.1 in

Additional Product Features

Intended AudienceCollege Audience

LCCN93-005662

Dewey Edition20

IllustratedYes

Dewey Decimal511.3

Table Of ContentI. ALGORITHMS. 1. Problems and Algorithms. 2. Turing Machines. 3. Undecidability. II. LOGIC. 1. Boolean Logic. 2. First Order Logic. 3. Undecidability in Logic. III. P AND NP. 1. Relations between Complexity Classes. 2. Reductions and Completeness. 3. NP-Complete Problems. 4. coNP and Function Problems. 5. Randomized Computation. 6. Cryptography. 7. Approximability. 8. On P vs. NP. IV. INSIDE P. 1. Parallel Computation. 2. Logarithmic Space. V. BEYOND NP. 1. The Polynomial Hierarchy. 2. Computation That Counts. 3. Polynomial Space. 4. A Glimpse Beyond. 0201530821T04062001

SynopsisThis 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, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.

LC Classification NumberQA267.7 .P36 1994