Critical points and Gröbner bases
From MaRDI portal
Publication:5244531
DOI10.1145/2442829.2442855zbMath1308.68171arXiv1202.0179OpenAlexW2018980874MaRDI QIDQ5244531
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Mohab Safey El Din
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.0179
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (13)
Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems ⋮ A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ Refined F5 Algorithms for Ideals of Minors of Square Matrices ⋮ Faster real root decision algorithm for symmetric polynomials ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ Real root finding for determinants of linear matrices ⋮ Sparse FGLM algorithms ⋮ The data singular and the data isotropic loci for affine cones ⋮ Solving determinantal systems using homotopy techniques ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ Critical points via monodromy and local methods ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Computing critical points for invariant algebraic systems
Uses Software
This page was built for publication: Critical points and Gröbner bases
