Rigidity of a simple extended lower triangular matrix

DOI10.1016/j.ipl.2008.02.010zbMath1189.65080OpenAlexW2161593287MaRDI QIDQ963424

Meena Mahajan, M. N. Jayalal Sarma

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

computational complexitycombinatorial problemsmatrix ranktriangular matricesbounds on rigidity

Mathematics Subject Classification ID

Related Items (1)

Complexity of linear circuits and geometry

Cites Work

• Unnamed Item
• Unnamed Item
• A remark on matrix rigidity
• A note on matrix rigidity
• Some combinatorial-algebraic problems from complexity theory
• Arithmetic complexity, Kleene closure, and formal power series
• On the rigidity of Vandermonde matrices
• Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
• Matrix rigidity
• Some structural properties of low-rank matrices related to computational complexity
• On the Complexity of Matrix Rank and Rigidity
• Theory and Applications of Models of Computation

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