First Page | Document Content | |
---|---|---|
Date: 2014-06-27 12:47:14Theoretical computer science Mathematics Computational complexity theory Logic in computer science Automated theorem proving NP-complete problems Electronic design automation Formal methods Conflict-driven clause learning Boolean satisfiability problem Clause Unit propagation | A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft ResearchAdd to Reading ListSource URL: csl.sri.comDownload Document from Source WebsiteFile Size: 363,26 KBShare 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 |