Back to Results
First PageMeta Content
Computational complexity theory / Theoretical computer science / Logic in computer science / Complexity classes / Mathematical optimization / Boolean algebra / NP-complete problems / Boolean satisfiability problem / 2-satisfiability / Horn-satisfiability / P versus NP problem / Exponential time hypothesis


Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen
Add to Reading List

Document Date: 2016-07-22 17:30:27

Open Document

File Size: 2,38 MB

Share Result on Facebook
UPDATE