22 search results - page 1 / 5 » Fractal Parallelism: Solving SAT in Bounded Space and Time |
ISAAC
2010
Springer
13 years 8 months ago
2010
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...
ACTA
2006
13 years 11 months ago
2006
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
TACAS
2010
Springer
14 years 5 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
JCSS
2000
13 years 10 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...