Back to Results
First PageMeta Content
Computational complexity theory / Complexity classes / Theory of computation / Polynomial hierarchy / P versus NP problem / IP / True quantified Boolean formula / NP / PP / Oracle machine / PSPACE-complete / Polynomial-time reduction


February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass
Add to Reading List

Document Date: 2009-02-04 17:20:26


Open Document

File Size: 83,14 KB

Share Result on Facebook