10 search results - page 1 / 2 » Inductive Time-Space Lower Bounds for Sat and Related Proble... |
CC
2006
Springer
13 years 11 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.
COCO
2005
Springer
14 years 4 months ago
2005
Springer
ECCC
2008
13 years 11 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...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CP
2007
Springer
14 years 5 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...