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

First Page		Document Content
Date: 2016-07-22 17:30:27 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 Source URL: formal.iti.kit.edu Download Document from Source Website File Size: 2,38 MB Share Document on Facebook

	A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research DocID: 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 2007 DocID: 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 gap DocID: 1upyZ - View Document
	Variant-Based Decidable Satisfiability in Initial Algebras with Predicates Ra´ ul Guti´errez1 1 DSIC, 2 University DocID: 1tEer - View Document
	2 Satisfiability Checking and Symbolic Computation (SC DocID: 1t40b - View Document