A trace bound for the hereditary discrepancy
Proceedings of the sixteenth annual symposium on Computational geometry
On the complexity of matrix product
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The power of nonmonotonicity in geometric searching
Proceedings of the eighteenth annual symposium on Computational geometry
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Lower bounds on the bounded coefficient complexity of bilinear maps
Journal of the ACM (JACM)
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Improved range searching lower bounds
Proceedings of the twenty-eighth annual symposium on Computational geometry
Hi-index | 0.00 |
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requires $\Omega(n\log n)$ additions and subtractions. This is the first nontrivial lower bound for range searching over a group. By contrast, range searching over a semigroup (which forbids subtractions) is almost completely understood.Our proof has two parts. First, we develop a general, entropy-based method for relating the linear circuit complexity of a linear map A to the spectrum of $A^\top\!A$. In the second part of the proof, we design a "high-spectrum" geometric set system for halfplane range searching and, using techniques from discrepancy theory, we estimate the median eigenvalue of its associated map. Interestingly, the method also shows that using up to a linear number of help gates cannot help; these are gates that can compute any bivariate function.