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


Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but
Add to Reading List

Document Date: 2014-12-28 09:03:23


Open Document

File Size: 1,48 MB

Share Result on Facebook
UPDATE