Back to Results
First PageMeta Content
Complexity classes / Computational complexity theory / Boolean algebra / Structural complexity theory / NP-complete problems / Boolean satisfiability problem / NP / PP / Reduction / True quantified Boolean formula / Exponential time hypothesis / P


Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV
Add to Reading List

Document Date: 2008-10-07 04:07:53

Open Document

File Size: 193,70 KB

Share Result on Facebook
UPDATE