22 search results - page 1 / 5 » Better Time-Space Lower Bounds for SAT and Related Problems |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
CC
2006
Springer
13 years 4 months ago
2006
Springer
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
ECCC
2008
13 years 4 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
AAAI
2004
13 years 6 months ago
2004
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
IJCAI
2007
13 years 6 months ago
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...