Date: 2016-07-22 17:30:27Computational 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¨ubingenAdd to Reading ListSource URL: formal.iti.kit.eduDownload Document from Source Website File Size: 2,38 MBShare Document on Facebook
|