Theory of computational complexity /

Theory of computational complexity /

Saved in:
Bibliographic Details
Author / Creator:Du, Dingzhu.
Imprint:New York : Wiley, c2000.
Description:xiii, 491 p. : ill. ; 25 cm.
Language:English
Series:Wiley-Interscience series in discrete mathematics and optimization
Subject:
Computational complexity.
Computational complexity.
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/4220963
Hidden Bibliographic Details
Other authors / contributors:Ko, Ker-I
ISBN:0471345067 (alk. paper)
Notes:Includes bibliographical references (p. 453-473) and index.
Table of Contents:
  • Uniform Complexity
  • Models of Computation and Complexity Classes
  • NP-Completeness
  • The Polynomial-Time Hierarchy and Polynomial Space
  • Structure of NP
  • Nonuniform Complexity
  • Decision Trees
  • Circuit Complexity
  • Polynomial-Time Isomorphism
  • Probabilistic Complexity
  • Probabilistic Machines and Complexity Classes
  • Complexity of Counting
  • Interactive Proof Systems
  • Probabilistically Checkable Proofs andNP-Hard Optimization Problems
  • Bibliography
  • Index

Similar Items