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


Motivation COMS21103 NP-completeness
Add to Reading List

Document Date: 2014-01-08 09:09:08

Open Document

File Size: 240,24 KB

Share Result on Facebook
UPDATE