Using elimination theory to construct rigid matrices
DOI10.4230/LIPICS.FSTTCS.2009.2327zbMATH Open1248.68221OpenAlexW2286151938MaRDI QIDQ2920137FDOQ2920137
Authors: Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma M. N. 
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a04f.html
Recommendations
- Using elimination theory to construct rigid matrices
- Matrices in elimination theory
- Some Elimination Problems for Matrices
- Efficient Construction of Rigid Matrices Using an NP Oracle
- A simple construction of elliptic \(R\)-matrices
- Computation of hybrid element matrices by elimination techniques
- A note on matrix rigidity
- A remark on matrix rigidity
- Explicit constructions of RIP matrices and related problems
- Rigidity of a simple extended lower triangular matrix
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Determinants, permanents, traces, other special matrix functions (15A15) Computational aspects of algebraic surfaces (14Q10) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (9)
- On the geometry of tensor network states of \(2\times N\) grids
- Complexity of linear circuits and geometry
- Theory and Applications of Models of Computation
- Unifying known lower bounds via geometric complexity theory
- Using elimination theory to construct rigid matrices
- On the rigidity of Vandermonde matrices
- Matrix Rigidity from the Viewpoint of Parameterized Complexity
- Degrees of projections of rank loci
- Geometric complexity theory: an introduction for geometers
This page was built for publication: Using elimination theory to construct rigid matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920137)
