Back to Results
First PageMeta Content
NP-complete problems / Complexity classes / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / 2-satisfiability / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics


Theory of Computation Chapter 9 Guan-Shieng Huang
Add to Reading List

Document Date: 2004-02-15 23:56:23

Open Document

File Size: 403,58 KB

Share Result on Facebook
UPDATE