A time-space tradeoff for sorting on non-oblivious machines

✍ Scribed by Allan Borodin; Michael J. Fischer; David G. Kirkpatrick; Nancy A. Lynch; Martin Tompa

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 853 KB
Volume: 22
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90037-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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