Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model

DOI10.4230/LIPIcs.FSTTCS.2018.45OpenAlexW2908474516MaRDI QIDQ5090986

No author found.

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.45

zbMATH Keywords

lower boundsmatrix factorizationrange queryingLagrange dual function

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items

Improved bounds on absolute positiveness of multivariate polynomials

Cites Work

• Multidimensional divide-and-conquer
• Fractional cascading. I: A data structuring technique
• Lower bounds on zero-one matrices.
• A Lower Bound on the Complexity of Orthogonal Range Queries
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Functions of Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item