168 search results - page 6 / 34 » On Nontrivial Approximation of CSPs |
STACS
2010
Springer
14 years 5 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
ECCC
2010
13 years 10 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...