Back to Results
First PageMeta Content
Complexity classes / NP / P versus NP problem / Cook–Levin theorem / P / Boolean satisfiability problem / Reduction / Time complexity / Co-NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics


i Computational Complexity: A Modern
Add to Reading List

Document Date: 2007-01-08 22:00:26

Open Document

File Size: 516,70 KB

Share Result on Facebook
UPDATE