Computability and complexity theory

Computability and complexity theory

by Homer, Steven

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Computability and complexity theory / Steven Homer, Alan L. Selman.

Edition Statements

  • Publication Date:©2011.
  • Edition:2nd ed

Publication Statements

  • Publisher(s):Springer
  • Place of Publication:New York
  • Language:eng
  • Publication Date:©2011.

The Physical Object

  • Description:1 online resource (xvi, 298 pages) : : ilustr.

Edition Identifiers

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

Read More ↓

Subjects

Complexité de calcul (Informatique) Computational complexity Computer Science Electronic Data Processing Information theory Informatique Théorie de l'information

Writers

Homer, Steven Selman, Alan L.

More from this Series

  • Computability and Complexity Theory

    2011.
    more →
    Computability and Complexity Theory

  • Computability and complexity theory

    cop. 2011.
    more →
    Computability and complexity theory

  • Computability and complexity theory

    cop. 2011.
    more →
    Computability and complexity theory

  • Computability and complexity theory

    c2011.
    more →
    Computability and complexity theory

  • Computability and Complexity Theory

    2011.
    more →
    Computability and Complexity Theory

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

No downloadable files are registered for this work yet.