skip to content
Computational complexity Preview this item
ClosePreview this item
Checking...

Computational complexity

Author: Christos H Papadimitriou
Publisher: Reading, Mass. : Addison-Wesley, ©1994.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Papadimitriou, Christos H.
Computational complexity.
Reading, Mass. : Addison-Wesley, c1994
(OCoLC)654178169
Document Type: Book
All Authors / Contributors: Christos H Papadimitriou
ISBN: 0201530821 9780201530827 0020153082 9780020153085
OCLC Number: 28421912
Description: xv, 523 p. : ill. ; 25 cm.
Contents: Pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability --
Pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic --
Pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP --
Pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space --
Pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond
Responsibility: Christos H. Papadimitriou.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(4)

User lists with this item (1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/28421912>
library:oclcnum"28421912"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/28421912>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:copyrightYear"1994"
schema:datePublished"1994"
schema:description"Pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- Pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- Pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- Pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- Pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond"
schema:exampleOfWork<http://worldcat.org/entity/work/id/30840215>
schema:inLanguage"en"
schema:name"Computational complexity"
schema:numberOfPages"523"
schema:publisher
schema:workExample
schema:workExample
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.