4 search results - page 1 / 1 » Limits on Alternation Trading Proofs for Time-Space Lower Bo... |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
KI
2001
Springer
13 years 9 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
JCSS
2000
13 years 4 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...
CORR
2002
Springer
13 years 4 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...