141 search results - page 8 / 29 » sat 2010 |
ECCC
2010
14 years 9 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
140
click to vote
MFCS
2010
Springer
14 years 7 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
KR
2010
Springer
15 years 2 months ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
ECCC
2006
14 years 9 months ago
2006
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...