<--- Back to Details
First PageDocument Content
Complexity classes / Polynomial hierarchy / PH / NP / P / Stephen Cook / NEXPTIME / Oracle machine / NC / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2006-11-24 04:10:57
Complexity classes
Polynomial hierarchy
PH
NP
P
Stephen Cook
NEXPTIME
Oracle machine
NC
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: www.scottaaronson.com

Download Document from Source Website

File Size: 31,55 KB

Share Document on Facebook

Similar Documents

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Excerpt More information

DocID: 1tqEc - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Copyright Information More information

DocID: 1tpid - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Frontmatter More information

DocID: 1toM0 - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Table of Contents More information

DocID: 1tfTF - View Document

Cambridge University Press4 - Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen Index More information

DocID: 1t9Zv - View Document