Back to Results
First PageMeta Content
Complexity classes / NP-complete / P versus NP problem / NP-hard / NP / Boolean satisfiability problem / P / Bounded-error probabilistic polynomial / NEXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2007-05-24 22:16:31

Open Document

File Size: 150,28 KB

Share Result on Facebook
UPDATE