Crossing the logarithmic barrier for dynamic boolean data structure lower bounds

Keyphrases

• Structure Problem 100%
• Data Structure Lower Bounds 100%
• Logarithmic Barrier 100%
• Boolean Data 100%
• Boolean 66%
• Range Counting 66%
• Dynamic Range 33%
• Sampling Methods 33%
• One-way Communication 33%
• Counting Problems 33%
• Computational Geometry 33%
• Communication Protocol 33%
• Dynamic Data Structures 33%
• Cell Samples 33%
• Obituary 33%
• Query Response Time 33%
• Chebyshev Polynomials 33%
• Centerpiece 33%
• Boolean Problems 33%
• Selection Range 33%
• Cell Probe 33%
• Non-Boolean 33%
• Spatial Database 33%
• Operating Time 33%
• Geometry Database 33%
• Rectangle Stabbing 33%
• Polynomial Evaluation 33%

Mathematics

• Data Structure 100%
• Open Problem 16%
• Wide Range 16%
• Counting Problem 16%
• Median 16%
• Dynamic Range 16%
• Low Degree 16%
• Chebyshev Polynomial 16%
• Polynomial Evaluation 16%

Computer Science

• Data Structure 100%
• Structure Problem 50%
• Communication Protocol 16%
• Computational Geometry 16%
• Chebyshev Polynomial 16%
• Polynomial Evaluation 16%
• Spatial Database 16%