The Geometry of Browsing

摘要

We present a geometric counting problem hat arises in browsing and solve it in constant time per query usign nonexhaustive tables. ON the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query.