Connecting Gröbner bases programs with Coq to do proofs in algebra, geometry and arithmetics

by Loïc Pottier , Inria Sophia Antipolis
Citations:3 - 0 self

Active Bibliography

1 Parametric linear arithmetic over ordered fields in Isabelle/HOL – Amine Chaieb
OPTIMIZATION OF POLYNOMIAL SYSTEM SOLVERS WITH APPLICATIONS TO VISUAL ODOMETRY – Oleg Naroditsky, Stergios I. Roumeliotis, Associate Professor, Kostas Daniilidis
ElimLin Algorithm Revisited – Nicolas T. Courtois, Pouyan Sepehrdad, Serge Vaudenay
Fast Algorithms, Modular Methods, Parallel Approaches and Software Engineering for Solving Polynomial Systems Symbolically – Yuzhen Xie - 2007
Motivation and Problem Statement. Solving multivariate quadratic polynomial – Magali Bardet , Jean-charles Faugère , Bruno Salvy , et al. - 2012
6 Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry – M. Safey El Din, P. Trébuchet - 2006
9 Multiple view geometry of non-planar algebraic curves – J. Yermiyahu Kaminski, Michael Fryers, Amnon Shashua, Mina Teicher - 2001
7 Variant quantifier elimination – Hoon Hong, Mohab Safey, El Din - 2011
Polynomial Systems Solving by Fast Linear Algebra. – Jean-charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
16 Fast algorithms for zero-dimensional polynomial systems using duality – Alin Bostan, Bruno Salvy, Éric Schost - 2001
10 Multiple View Geometry of General Algebraic Curves – J. Y. Kaminski , Amnon Shashua
unknown title – Pierrick Gaudry
2 Symbolic-numeric methods for solving polynomial equations – B. Mourrain
6 Stable normal forms for polynomial system solving – Bernard Mourrain, et al. - 2008
1 Critical Points and Gröbner Bases: the Unmixed Case – Jean-charles Faugère, Mohab Safey El Din, Pierre-jean Spaenlehauer - 2012
PROBABILISTIC ALGORITHM FOR POLYNOMIAL OPTIMIZATION OVER A REAL ALGEBRAIC SET – Aurélien Greuet, Mohab Safey El Din - 2013
20 Computing Parametric Geometric Resolutions – Eric Schost - 2001
11 Computing Loci of Rank Defects of Linear Matrices using Gröbner Bases and Applications to Cryptology – Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer - 2010
9 Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity – Jean-charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer - 2010