88 search results - page 3 / 18 » Reducing hard SAT instances to polynomial ones |
199
click to vote
CSR
2007
Springer
16 years 26 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
145
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
162
click to vote
WINE
2005
Springer
16 years 4 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
170
click to vote
CP
2007
Springer
16 years 26 days ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
174
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...