1 option
Computational complexity theory / Steven Rudich, Avi Wigderson, editors
- Format:
- Book
- Series:
- IAS/Park City Mathematics Series, 2472-5064 ; v. 10
- Language:
- English
- Subjects (All):
- Computational complexity.
- Physical Description:
- 1 online resource
- Place of Publication:
- Providence, R.I. American Mathematical Society [2004]
- [Princeton, N.J.] Institute for Advanced Study [2004]
- Contents:
- Introduction Complexity theory: From Gödel to Feynman Average case complexity Exploring complexity through reductions Quantum computation Circuit and Communication Complexity Proof complexity Preface to "Week Three: Randomness in Computation" Pseudorandomness
- Part I Pseudorandomness
- Part II Probabilistic proof systems
- Part I Probabilistically checkable proofs
- Notes:
- "Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso
- Includes bibliographical references
- Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
- Description based on print version record
- Other Format:
- Print version: Computational complexity theory
- ISBN:
- 9781470439095
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.