Pages that link to "Item:Q390388"
From MaRDI portal
The following pages link to On the complexity of the generalized MinRank problem (Q390388):
Displayed 17 items.
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Solving multivariate polynomial systems and an invariant from commutative algebra (Q2232206) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- A new encryption scheme for multivariate quadratic systems (Q2290641) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- The Complexity of MinRank (Q5048630) (← links)
- A Secure Variant of the SRP Encryption Scheme with Shorter Private Key (Q5056015) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- Improvement of algebraic attacks for solving superdetermined MinRank instances (Q6111581) (← links)
- Algebraic relation of three MinRank algebraic modelings (Q6169016) (← links)