Theory of Computation

In these early years of the 21st Century, researchers in the field of computing are delving ever further into the new possibilities of the science and to the primary tools that form its foundations. The theory behind computation has never been more important. Theory of Computation is a unique textbo...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kozen, Dexter C. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Texts in Computer Science,
Temas:
Computer science.
Mathematics > Data processing.
Algorithms.
Theory of Computation.
Computational Mathematics and Numerical Analysis.
Computational Science and Engineering.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Lectures
  • The Complexity of Computations
  • Time and Space Complexity Classes and Savitch's Theorem
  • Separation Results
  • The Immerman-Szelepcsényi Theorem
  • Logspace Computability
  • The Circuit Value Problem
  • The Knaster-Tarski Theorem
  • Alternation
  • Problems Complete for PSPACE
  • The Polynomial-Time Hierarchy
  • More on the Polynomial-Time Hierarchy
  • Parallel Complexity
  • Relation of NC to Time-Space Classes
  • Probabilistic Complexity
  • BPP ?2P ? ?2P
  • Chinese Remaindering
  • Complexity of Primality Testing
  • Berlekamp's Algorithm
  • Interactive Proofs
  • PSPACE IP
  • IP PSPACE
  • Probabilistically Checkable Proofs
  • NP PCP(n3, 1)
  • More on PCP
  • A Crash Course in Logic
  • Complexity of Decidable Theories
  • Complexity of the Theory of Real Addition
  • Lower Bound for the Theory of Real Addition
  • Lower Bound for Integer Addition
  • Automata on Infinite Strings and S1S
  • Determinization of ?-Automata
  • Safra's Construction
  • Relativized Complexity
  • Nonexistence of Sparse Complete Sets
  • Unique Satisfiability
  • Toda's Theorem
  • Circuit Lower Bounds and Relativized PSPACE = PH
  • Lower Bounds for Constant Depth Circuits
  • The Switching Lemma
  • Tail Bounds
  • The Gap Theorem and Other Pathology
  • Partial Recursive Functions and Gödel Numberings
  • Applications of the Recursion Theorem
  • Abstract Complexity
  • The Arithmetic Hierarchy
  • Complete Problems in the Arithmetic Hierarchy
  • Post's Problem
  • The Friedberg-Muchnik Theorem
  • The Analytic Hierarchy
  • Kleene's Theorem
  • Fair Termination and Harel's Theorem
  • Exercises
  • Homework 1
  • Homework 2
  • Homework 3
  • Homework 4
  • Homework 5
  • Homework 6
  • Homework 7
  • Homework 8
  • Homework 9
  • Homework 10
  • Homework 11
  • Homework 12
  • Miscellaneous Exercises
  • Hints and Solutions
  • Homework 1 Solutions
  • Homework 2 Solutions
  • Homework 3 Solutions
  • Homework 4 Solutions
  • Homework 5 Solutions
  • Homework 6 Solutions
  • Homework 7 Solutions
  • Homework 8 Solutions
  • Homework 9 Solutions
  • Homework 10 Solutions
  • Homework 11 Solutions
  • Homework 12 Solutions
  • Hints for Selected Miscellaneous Exercises
  • Solutions to Selected Miscellaneous Exercises.

Ejemplares similares