Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
From MaRDI portal
Publication:629349
DOI10.1016/j.jsc.2010.10.014zbMath1226.13017OpenAlexW2010865943MaRDI QIDQ629349
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Publication date: 9 March 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.10.014
Related Items
Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, On the complexity of the generalized MinRank problem, Improvement of algebraic attacks for solving superdetermined MinRank instances, Real root finding for determinants of linear matrices, Take your MEDS: digital signatures from matrix code equivalence, On the complexity of solving generic overdetermined bilinear systems, A survey on signature-based algorithms for computing Gröbner bases, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, Multihomogeneous resultant formulae for systems with scaled support, Computing modular correspondences for abelian varieties, A lifted square formulation for certifiable Schubert calculus, Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems, Multilinear polynomial systems: root isolation and bit complexity, The product of matrix subspaces, The Euclidean distance degree of an algebraic variety, Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, An algebraic attack on rank metric code-based cryptosystems, Multivariate public key cryptosystem from Sidon spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of maximal minors
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Maximal minors and their leading terms
- New technique for decoding codes in the rank metric and its cryptography applications
- Multihomogeneous resultant formulae by means of complexes
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Computing multihomogeneous resultants using straight-line programs
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Cryptanalysis of MinRank
- Multihomogeneous resultant formulae for systems with scaled support
