Polynomial data structure lower bounds in the group model

Keyphrases

• Data Structure Lower Bounds 100%
• Group Model 100%
• Compressed Sensing Matrices 66%
• Derandomization 33%
• Compressed Sensing 33%
• Sparsity 33%
• Counting Problems 33%
• Combined Technique 33%
• Pseudorandomness 33%
• Diophantine Approximation 33%
• Fundamental Challenges 33%
• Convex Polygon 33%
• Computational Geometry 33%
• Binary Compressed Sensing 33%
• Semialgebraic 33%
• Range Counting 33%
• Omega-1 33%
• Static Groups 33%

Mathematics

• Polynomial 100%
• Data Structure 100%
• Matrix (Mathematics) 66%
• Derandomization 33%
• Polygon 33%
• Counting Problem 33%
• Diophantine Approximation 33%
• Flat Surface 33%