Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > LOGARITHMIC FORM:
Reports tagged with logarithmic form:
TR09-005 | 7th December 2008
Emanuele Viola

#### Bit-Probe Lower Bounds for Succinct Data Structures

We prove lower bounds on the redundancy necessary to
represent a set $S$ of objects using a number of bits
close to the information-theoretic minimum $\log_2 |S|$,
while answering various queries by probing few bits. Our
main results are:

\begin{itemize}
\item To represent $n$ ternary values $t \in \zot^n$ in ... more >>>

ISSN 1433-8092 | Imprint