<--- Back to Details
First PageDocument Content
Complexity classes / True quantified Boolean formula / PSPACE-complete / FO / NP / P / NSPACE / DSPACE / Cook–Levin theorem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2007-01-08 22:00:38
Complexity classes
True quantified Boolean formula
PSPACE-complete
FO
NP
P
NSPACE
DSPACE
Cook–Levin theorem
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: www.cs.princeton.edu

Download Document from Source Website

File Size: 374,16 KB

Share Document on Facebook

Similar Documents

Complexity classes / True quantified Boolean formula / PSPACE-complete / FO / NP / P / NSPACE / DSPACE / Cook–Levin theorem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

DocID: 179e - View Document

Complexity classes / Time hierarchy theorem / NTIME / DTIME / DSPACE / NSPACE / Space hierarchy theorem / Alternating Turing machine / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

DocID: FLL - View Document