Rigidity of a simple extended lower triangular matrix

DOI10.1016/J.IPL.2008.02.010MaRDI QIDQ963424zbMATH OpenOpenAlexFDO

Authors Meena Mahajan, Jayalal Sarma M. N.

Publication date 19 April 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.02.010

zbMATH Keywords

bounds on rigiditycombinatorial problemscomputational complexitymatrix ranktriangular matrices

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 37868
• Lower Bounds on Matrix Rigidity Via a Quantum Argument
• Theory and Applications of Models of Computation
• Matrix rigidity
• On the rigidity of Vandermonde matrices

Cites work

• A note on matrix rigidity
• A remark on matrix rigidity
• Arithmetic complexity, Kleene closure, and formal power series
• scientific article; zbMATH DE number 37868 (Why is no real title available?)
• scientific article; zbMATH DE number 3597878 (Why is no real title available?)
• Matrix rigidity
• On the Complexity of Matrix Rank and Rigidity
• On the rigidity of Vandermonde matrices
• Some combinatorial-algebraic problems from complexity theory
• Some structural properties of low-rank matrices related to computational complexity
• Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
• Theory and Applications of Models of Computation

Cited in

(3)

• Using elimination theory to construct rigid matrices
• Complexity of linear circuits and geometry
• scientific article; zbMATH DE number 37868 (Why is no real title available?)

This page was built for publication: Rigidity of a simple extended lower triangular matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963424)