989 search results - page 152 / 198 » Pebbling and Proofs of Work |
JCSS
2000
13 years 7 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...
IGPL
2002
13 years 7 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
SIAMCO
2000
13 years 7 months ago
2000
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
AI
1998
Springer
13 years 7 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...