✦ LIBER ✦

Inductive Time-Space Lower Bounds for Sat and Related Problems

✍ Scribed by Ryan Williams

Publisher: Springer
Year: 2006
Tongue: English
Weight: 339 KB
Volume: 15
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-007-0221-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tighter Lower Bounds for Nearest Neighbo

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

✍ Omer Barkol; Yuval Rabani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

On the equivalence of the max-min transp

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

✍ Yunpeng Pan; Leyuan Shi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

The lyapunov equation and the problem of

The lyapunov equation and the problem of stability for linear bounded discrete-time systems in Hilbert space

✍ K. Maciej Przyluski 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 741 KB