Lower bounds on zero-one matrices.

DOI10.1016/J.LAA.2003.06.018zbMath1059.15021OpenAlexW2127176484MaRDI QIDQ1415303

A. Toni

Publication date: 3 December 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.06.018

zbMATH Keywords

matrix equationslower boundszero-one matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix equations and identities (15A24) Matrices of integers (15B36)

Related Items (1)

Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model

Cites Work

• Inherent complexity trade-offs for range query problems
• On the Complexity of Maintaining Partial Sums
• Lower Bounds on the Complexity of Some Optimal Data Structures
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

This page was built for publication: Lower bounds on zero-one matrices.