𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A time-space tradeoff for language recognition

✍ Scribed by Pavol Dúriś; Zvi Galil

Book ID
105296897
Publisher
Springer
Year
1984
Tongue
English
Weight
606 KB
Volume
17
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time–Space Tradeoffs for Satisfiability
Time–Space Tradeoffs for Satisfiability
✍ Lance Fortnow 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

We give the first nontrivial model-independent time space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved in n 1+o(1) time and n 1&= space for any =>0 general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing mac

Topological parameters for time-space tr
Topological parameters for time-space tradeoff
✍ Rina Dechter; Yousri El Fattah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 463 KB

In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure, the user ca

Time–Space Tradeoffs for Branching Progr
Time–Space Tradeoffs for Branching Programs
✍ Paul Beame; T.S. Jayram; Michael Saks 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 265 KB

We obtain the first non-trivial time-space tradeoff lower bound for functions f: {0, 1} n Q {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e > 0. We also give the firs