𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time-space trade-offs for branching programs

✍ Scribed by Ingo Wegener

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
384 KB
Volume
32
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Time-space trade-offs for compressed suf
Time-space trade-offs for compressed suffix arrays
✍ S.Srinivasa Rao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed