✦ LIBER ✦

Two time-space tradeoffs for element distinctness

✍ Scribed by Mauricio Karchmer

Book ID: 107948566
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 588 KB
Volume: 47
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90150-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Space-time tradeoffs for linear recursio

Space-time tradeoffs for linear recursion

✍ Sowmitri Swamy; John E. Savage 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 886 KB

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

A time-space tradeoff for language recog

A time-space tradeoff for language recognition

✍ Pavol Dúriś; Zvi Galil 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 606 KB

Time–Space Tradeoffs for SAT on Nonunifo

Time–Space Tradeoffs for SAT on Nonuniform Machines

✍ Iannis Tourlakis 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 176 KB

are generalized and combined with an argument for diagonalizing over machines taking n bits of advice on inputs of length n to obtain the first nontrivial time-space lower bounds for SAT on nonuniform machines. In particular, we show that for any a < `2 and any e > 0, SAT cannot be computed by a ra