Abstract
A static data structure problem consists of a set of data D, a set of queries Q and a function/with domain D X Q. Given a space bound b, a (good) solution to the problem is an encoding e: D → {0,1}b, so that for any y, f(x,y) can be determined (quickly) by probing e(x). The worst case number of probes needed is Cb(f), the bit probe complexity of f. We study the properties of the complexity measure Cb(-).
Cite
CITATION STYLE
Miltersen, P. B. (1993). The bit probe complexity measure revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 662–671). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
