Sub-cubic change of ordering for Gröbner basis

DOI10.1145/2608628.2608669zbMath1325.68277OpenAlexW2003767038MaRDI QIDQ3452391

Jean-Charles Faugère, Guénaël Renault, Louise Huot, Pierrick Gaudry

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608669

zbMATH Keywords

Gröbner basispolynomial systemschange of ordering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Related Items (11)

On the complexity exponent of polynomial system solving ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Sparse FGLM algorithms ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Fast computation of generic bivariate resultants ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Guessing Gröbner bases of structured ideals of relations of sequences ⋮ Accelerated tower arithmetic ⋮ A multivariate quadratic challenge toward post-quantum generation cryptography

Uses Software

• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: Sub-cubic change of ordering for Gröbner basis