First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 2,38 MBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |