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 |
A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft ResearchDocID: 1xVCc - View Document | |
SMT Workshop’07 5th International Workshop on Satisfiability Modulo Theories (Previously called PDPAR: Pragmatics of Decision Procedures in Automated Reasoning) Affiliated with CAV’07 Berlin, Germany, 1-2 July 2007DocID: 1xTbI - View Document | |
Gap Amplification Fails Below 1/2 Andrej Bogdanov June 1, 2005 Abstract The gap amplification lemma of Dinur (ECCC TR05-46) states that the satisfiability gapDocID: 1upyZ - View Document | |
Variant-Based Decidable Satisfiability in Initial Algebras with Predicates Ra´ ul Guti´errez1 1 DSIC, 2 UniversityDocID: 1tEer - View Document | |
2 Satisfiability Checking and Symbolic Computation (SCDocID: 1t40b - View Document |