Using elimination theory to construct rigid matrices
From MaRDI portal
Publication:2920137
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)
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
Cited in
(9)- On the geometry of tensor network states of \(2\times N\) grids
- Matrix Rigidity from the Viewpoint of Parameterized Complexity
- Geometric complexity theory: an introduction for geometers
- Complexity of linear circuits and geometry
- On the rigidity of Vandermonde matrices
- Theory and Applications of Models of Computation
- Unifying known lower bounds via geometric complexity theory
- Degrees of projections of rank loci
- Using elimination theory to construct rigid matrices
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)
