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:   Print book : English : 2nd edView all editions and formats
Database:WorldCat
Summary:
Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical  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:

Abstract:

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...

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


Primary Entity

<http://www.worldcat.org/oclc/751753304> # Computability and complexity theory
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "751753304" ;
    library:placeOfPublication <http://dbpedia.org/resource/London> ; # London
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    schema:about <http://id.worldcat.org/fast/871985> ; # Computable functions
    schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
    schema:about <http://experiment.worldcat.org/entity/work/data/34630242#Topic/berechnungstheorie> ; # Berechnungstheorie
    schema:about <http://experiment.worldcat.org/entity/work/data/34630242#Topic/komplexitatstheorie> ; # Komplexitätstheorie
    schema:about <http://dewey.info/class/004/e23/> ;
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:bookEdition "2nd ed." ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/59169347> ; # Alan L. Selman
    schema:copyrightYear "2011" ;
    schema:creator <http://viaf.org/viaf/59173472> ; # Steven Homer
    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:description "Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/34630242> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/34630242#Series/texts_in_computer_science> ; # Texts in computer science.
    schema:name "Computability and complexity theory"@en ;
    schema:productID "751753304" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/751753304#PublicationEvent/new_york_london_springer_2011> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/34630242#Agent/springer> ; # Springer
    schema:workExample <http://worldcat.org/isbn/9781461406822> ;
    schema:workExample <http://worldcat.org/isbn/9781461406815> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB199776> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/751753304> ;
    .


Related Entities

<http://dbpedia.org/resource/London> # London
    a schema:Place ;
    schema:name "London" ;
    .

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/34630242#Series/texts_in_computer_science> # Texts in computer science.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/751753304> ; # Computability and complexity theory
    schema:name "Texts in computer science." ;
    schema:name "Texts in computer science" ;
    .

<http://experiment.worldcat.org/entity/work/data/34630242#Topic/berechnungstheorie> # Berechnungstheorie
    a schema:Intangible ;
    schema:name "Berechnungstheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/34630242#Topic/komplexitatstheorie> # Komplexitätstheorie
    a schema:Intangible ;
    schema:name "Komplexitätstheorie"@en ;
    .

<http://id.worldcat.org/fast/871985> # Computable functions
    a schema:Intangible ;
    schema:name "Computable functions"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
    schema:name "Computer science"@en ;
    .

<http://viaf.org/viaf/59169347> # Alan L. Selman
    a schema:Person ;
    schema:familyName "Selman" ;
    schema:givenName "Alan L." ;
    schema:name "Alan L. Selman" ;
    .

<http://viaf.org/viaf/59173472> # Steven Homer
    a schema:Person ;
    schema:familyName "Homer" ;
    schema:givenName "Steven" ;
    schema:givenName "S." ;
    schema:name "Steven Homer" ;
    .

<http://worldcat.org/isbn/9781461406815>
    a schema:ProductModel ;
    schema:bookFormat schema:Hardcover ;
    schema:isbn "1461406811" ;
    schema:isbn "9781461406815" ;
    .

<http://worldcat.org/isbn/9781461406822>
    a schema:ProductModel ;
    schema:description "e-ISBN" ;
    schema:isbn "146140682X" ;
    schema:isbn "9781461406822" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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