Using elimination theory to construct rigid matrices
From MaRDI portal
(Redirected from Publication:2920137)
Using elimination theory to construct rigid matrices (scientific article; zbMATH DE number 6098236)
Using elimination theory to construct rigid matrices (scientific article; zbMATH DE number 6098236)
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of algebraic surfaces (14Q10) Vector spaces, linear dependence, rank, lineability (15A03) Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
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 rigidity of Vandermonde matrices
- Geometric complexity theory: an introduction for geometers
- Unifying known lower bounds via geometric complexity theory
- On the geometry of tensor network states of \(2\times N\) grids
- Complexity of linear circuits and geometry
- Degrees of projections of rank loci
- Matrix Rigidity from the Viewpoint of Parameterized Complexity
- Using elimination theory to construct rigid matrices
- Theory and Applications of Models of Computation
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)
