Coverart for item
The Resource Theory of computation, Dexter C. Kozen

Theory of computation, Dexter C. Kozen

Label
Theory of computation
Title
Theory of computation
Statement of responsibility
Dexter C. Kozen
Creator
Subject
Genre
Language
eng
Summary
Dexter Kozen covers core material in the foundations of computing, as well as providing an introduction to some more advanced contemporary topics. He focuses primarily on computational complexity theory - the classification of computational problems in terms of their inherent complexity
Member of
Cataloging source
UKM
http://library.link/vocab/creatorDate
1951-
http://library.link/vocab/creatorName
Kozen, Dexter
Dewey number
511.352
Illustrations
illustrations
Index
index present
LC call number
QA267.7
LC item number
.K69 2006
Literary form
non fiction
Nature of contents
bibliography
Series statement
Texts in computer science
http://library.link/vocab/subjectName
  • Computational complexity
  • Computer science
  • Recursion theory
Label
Theory of computation, Dexter C. Kozen
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages [391]-398) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 5.
  • Logspace Computability
  • 6.
  • The Circuit Value Problem
  • A.
  • The Knaster-Tarski Theorem
  • 7.
  • Alternation
  • 8.
  • Problems Complete for PSPACE
  • 1.
  • 9.
  • The Polynomial-Time Hierarchy
  • 10.
  • More on the Polynomial-Time Hierarchy
  • 11.
  • Parallel Complexity
  • 12.
  • Relation of NC to Time-Space Classes
  • 13.
  • Probabilistic Complexity
  • The Complexity of Computations
  • 14.
  • BPP [characters not reproducible]
  • B.
  • Chinese Remaindering
  • C.
  • Complexity of Primality Testing
  • D.
  • Berlekamp's Algorithm
  • 15.
  • Interactive Proofs
  • 2.
  • 16.
  • PSPACE [characters not reproducible] IP
  • Time and Space Complexity Classes and Savitch's Theorem
  • 3.
  • Separation Results
  • 4.
  • The Immerman-Szelepcsenyi Theorem
Control code
63137198
Dimensions
25 cm
Extent
xiii, 418 pages
Isbn
9781846282973
Isbn Type
(acid-free paper)
Lccn
2005937504
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other control number
9781846282973
Other physical details
illustrations
Label
Theory of computation, Dexter C. Kozen
Publication
Bibliography note
Includes bibliographical references (pages [391]-398) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 5.
  • Logspace Computability
  • 6.
  • The Circuit Value Problem
  • A.
  • The Knaster-Tarski Theorem
  • 7.
  • Alternation
  • 8.
  • Problems Complete for PSPACE
  • 1.
  • 9.
  • The Polynomial-Time Hierarchy
  • 10.
  • More on the Polynomial-Time Hierarchy
  • 11.
  • Parallel Complexity
  • 12.
  • Relation of NC to Time-Space Classes
  • 13.
  • Probabilistic Complexity
  • The Complexity of Computations
  • 14.
  • BPP [characters not reproducible]
  • B.
  • Chinese Remaindering
  • C.
  • Complexity of Primality Testing
  • D.
  • Berlekamp's Algorithm
  • 15.
  • Interactive Proofs
  • 2.
  • 16.
  • PSPACE [characters not reproducible] IP
  • Time and Space Complexity Classes and Savitch's Theorem
  • 3.
  • Separation Results
  • 4.
  • The Immerman-Szelepcsenyi Theorem
Control code
63137198
Dimensions
25 cm
Extent
xiii, 418 pages
Isbn
9781846282973
Isbn Type
(acid-free paper)
Lccn
2005937504
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other control number
9781846282973
Other physical details
illustrations

Library Locations

    • Mathematical Sciences LibraryBorrow it
      104 Ellis Library, Columbia, MO, 65201, US
      38.944377 -92.326537
Processing Feedback ...