skip to content
Computability and complexity theory Preview this item
ClosePreview this item
Checking...

Computability and complexity theory

Author: S Homer; Alan L Selman
Publisher: New York ; London : Springer, ©2011.
Series: Texts in computer science.
Edition/Format:   Book : English : 2nd edView all editions and formats
Database:WorldCat
Summary:

This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit  Read more...

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

Document Type: Book
All Authors / Contributors: S Homer; Alan L Selman
ISBN: 9781461406815 1461406811 9781461406822 146140682X
OCLC Number: 751753304
Description: xvi, 298 pages : illustrations ; 24 cm.
Contents: 1. Preliminaries --
2. Introduction to computability --
3. Undecidability --
4. Introduction to complexity theory --
5. Basic results of complexity theory --
6. Nondeterminism and NP-completeness --
7. Relative computability --
8. Nonuniform complexity --
9. Parallelism --
10. Probabilistic complexity classes --
11. Introduction to counting classes --
12. Interactive proof systems.
Series Title: Texts in computer science.
Responsibility: Steven Homer, Alan L. Selman.
More information:

Reviews

Editorial reviews

Publisher Synopsis

From the reviews: "The difference between this new introductory graduate textbook in theoretical computer science and other texts is that the authors have chosen to concentrate on computability Read more...

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

Tags

Be the first.
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/751753304>
library:oclcnum"751753304"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:bookEdition"2nd ed."
schema:contributor
schema:copyrightYear"2011"
schema:creator
schema:datePublished"2011"
schema:description"1. Preliminaries -- 2. Introduction to computability -- 3. Undecidability -- 4. Introduction to complexity theory -- 5. Basic results of complexity theory -- 6. Nondeterminism and NP-completeness -- 7. Relative computability -- 8. Nonuniform complexity -- 9. Parallelism -- 10. Probabilistic complexity classes -- 11. Introduction to counting classes -- 12. Interactive proof systems."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/34630242>
schema:inLanguage"en"
schema:isPartOf
schema:name"Computability and complexity theory"@en
schema:publication
schema:publisher
schema:workExample
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBB199776>
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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