CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games

First Page		Document Content
Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics		CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 921,19 KB 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