𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inherent complexity trade-offs for range query problems

✍ Scribed by Walter A. Burkhard; Michael L. Fredman; Daniel J. Kleitman

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
922 KB
Volume
16
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spectral Methods for Matrix Rigidity wit
Spectral Methods for Matrix Rigidity with Applications to Size–Depth Trade-offs and Communication Complexity
✍ Satyanarayana V. Lokam πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 210 KB

The rigidity of a matrix measures the number of entries that must be changed in order to reduce its rank below a certain value. The known lower bounds on the rigidity of explicit matrices are very weak. It is known that stronger lower bounds would have important consequences in complexity theory. We