Pierre-Jean Spaenlehauer

Generating author description...

All published works

Action	Title	Year	Authors
+	Fast Algebraic Algorithms for Arithmetic Geometry and Polynomial Systems	2025	Pierre-Jean Spaenlehauer
+ PDF Chat	Computing a group action from the class field theory of imaginary hyperelliptic function fields	2024	Antoine Leudière Pierre-Jean Spaenlehauer
+ PDF Chat	Dimension results for extremal-generic polynomial systems over complete toric varieties	2024	Matías R. Bender Pierre-Jean Spaenlehauer
+ PDF Chat	Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields	2022	Pierre-Jean Spaenlehauer Antoine Leudière
+	Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields	2022	Pierre-Jean Spaenlehauer Antoine Leudière
+	A fast randomized geometric algorithm for computing Riemann-Roch spaces	2020	Aude Le Gluher Pierre-Jean Spaenlehauer
+	Refined Analysis of the Asymptotic Complexity of the Number Field Sieve	2020	Aude Le Gluher Pierre-Jean Spaenlehauer Emmanuel Thomé
+ PDF Chat	Counting points on genus-3 hyperelliptic curves with explicit real multiplication	2019	Simon Abelard Pierrick Gaudry Pierre-Jean Spaenlehauer
+ PDF Chat	Improved Complexity Bounds for Counting Points on Hyperelliptic Curves	2018	Simon Abelard Pierrick Gaudry Pierre-Jean Spaenlehauer
+ PDF Chat	A Polyhedral Method for Sparse Systems with Many Positive Solutions	2018	Frédéric Bihan Francisco Santos Pierre-Jean Spaenlehauer
+	Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.	2017	Simon Abelard Pierrick Gaudry Pierre-Jean Spaenlehauer
+	Improved Complexity Bounds for Counting Points on Hyperelliptic Curves	2017	Simon Abelard Pierrick Gaudry Pierre-Jean Spaenlehauer
+ PDF Chat	Critical Point Computations on Smooth Varieties	2016	Mohab Safey El Din Pierre-Jean Spaenlehauer
+ PDF Chat	Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems	2016	Jean‐Charles Faugère Pierre-Jean Spaenlehauer Jules Svartz
+	Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems	2016	Jean‐Charles Faugère Pierre-Jean Spaenlehauer Jules Svartz
+	Critical Point Computations on Smooth Varieties: Degree and Complexity bounds	2016	Mohab Safey El Din Pierre-Jean Spaenlehauer
+	Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems	2016	Jean‐Charles Faugère Pierre-Jean Spaenlehauer Jules Svartz
+	Critical Point Computations on Smooth Varieties: Degree and Complexity bounds	2016	Mohab Safey El Din Pierre-Jean Spaenlehauer
+ PDF Chat	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation	2015	Éric Schost Pierre-Jean Spaenlehauer
+	Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes	2015	Frédéric Bihan Pierre-Jean Spaenlehauer
+	Sparse Gröbner bases: the unmixed case	2014	Jean‐Charles Faugère Pierre-Jean Spaenlehauer Jules Svartz
+ PDF Chat	Sparse Gröbner bases	2014	Jean‐Charles Faugère Pierre-Jean Spaenlehauer Jules Svartz
+	Newton-like iteration for determinantal systems and structured low rank approximation	2014	Éric Schost Pierre-Jean Spaenlehauer
+ PDF Chat	On the Complexity of Computing Critical Points with Gröbner Bases	2014	Pierre-Jean Spaenlehauer
+ PDF Chat	Exact Solutions in Structured Low-Rank Approximation	2014	Giorgio Ottaviani Pierre-Jean Spaenlehauer Bernd Sturmfels
+	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation	2013	Éric Schost Pierre-Jean Spaenlehauer
+	Algebraic Methods for Structured Low-Rank Approximation.	2013	Giorgio Ottaviani Pierre-Jean Spaenlehauer Bernd Sturmfels
+	Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case.	2013	Pierre-Jean Spaenlehauer
+	On the complexity of the generalized MinRank problem	2013	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation	2013	Éric Schost Pierre-Jean Spaenlehauer
+	On the Complexity of Computing Critical Points with Gröbner Bases	2013	Pierre-Jean Spaenlehauer
+	Critical points and Gröbner bases	2012	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	On the complexity of solving quadratic Boolean systems	2012	Magali Bardet Jean‐Charles Faugère Bruno Salvy Pierre-Jean Spaenlehauer
+	Critical Points and Gr	2012	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	Critical Points and Gr\"obner Bases: the Unmixed Case	2012	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	On the Complexity of the Generalized MinRank Problem	2011	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	On the Complexity of the Generalized MinRank Problem	2011	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+ PDF Chat	Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity	2010	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	Gr\"obner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity	2010	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer
+	Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity	2010	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer

Common Coauthors

Coauthor	Papers Together
Jean‐Charles Faugère	15
Mohab Safey El Din	12
Jules Svartz	5
Éric Schost	4
Pierrick Gaudry	4
Simon Abelard	4
Antoine Leudière	3
Giorgio Ottaviani	2
Bernd Sturmfels	2
Frédéric Bihan	2
Aude Le Gluher	2
Francisco Santos	1
Matías R. Bender	1
Bruno Salvy	1
Magali Bardet	1
Emmanuel Thomé	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Commutative algebra with a view toward algebraic geometry	1996	David Eisenbud	13
+	Algorithms for matrix canonical forms	2000	Arne Storjohann	10
+	Polar varieties and computation of one point in each connected component of a smooth real algebraic set	2003	Mohab Safey El Din Éric Schost	10
+ PDF Chat	On the geometry of polar varieties	2010	Bernd Bank M Giusti Joos Heintz Mohab Safey El Din Éric Schost	9
+	Generalized polar varieties: geometry and algorithms	2005	B. Bank M Giusti Joos Heintz Luis Miguel Pardo	7
+	Combinatorial Commutative Algebra	2005	Ezra Miller Bernd Sturmfels	7
+ PDF Chat	Algebraic Degree of Polynomial Optimization	2009	Jiawang Nie Kristian Ranestad	7
+	The number of roots of a system of equations	1979	D. N. Bernshtein	6
+	Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case	1996	B. Bank M Giusti Joos Heintz Rainer Mandel G. M. Mbakop	6
+	On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations	2004	Jean‐Charles Faugère Magali Bardet Bruno Salvy	6
+ PDF Chat	The maximum likelihood degree	2006	Fabrizio Catanese Serkan Hoşten Amit Khetan Bernd Sturmfels	6
+ PDF Chat	A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets	2017	Mohab Safey El Din Éric Schost	6
+	Critical points and Gröbner bases	2012	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer	5
+ PDF Chat	The Euclidean Distance Degree of an Algebraic Variety	2015	Jan Draisma Emil Horobeţ Giorgio Ottaviani Bernd Sturmfels Rekha R. Thomas	5
+ PDF Chat	On the Hilbert function of determinantal rings and their canonical module	1994	Aldo Conca Jürgen Herzog	5
+ PDF Chat	An inequality for Hilbert series of graded algebras.	1985	Ralf Fröberg	5
+	On the complexity of the generalized MinRank problem	2013	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer	5
+ PDF Chat	Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity	2010	Jean‐Charles Faugère Mohab Safey El Din Pierre-Jean Spaenlehauer	4
+	Cohen-Macaulay Rings, Invariant Theory, and the Generic Perfection of Determinantal Loci	1971	Melvin Hochster J. A. Eagon	4
+	Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal	2005	Bruno Buchberger	4
+	Structured Low Rank Approximation of a Sylvester Matrix	2007	Erich Kaltofen Zhengfeng Yang Lihong Zhi	4
+	The Euclidean distance degree of an algebraic variety	2013	Jan Draisma Emil Horobeţ Giorgio Ottaviani Bernd Sturmfels Rekha R. Thomas	4
+ PDF Chat	A class of perfect determinantal ideals	1970	Melvin Hochster J. A. Eagon	4
+	Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case	1997	B. Bank M Giusti Joos Heintz G. M. Mbakop	4
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	4
+ PDF Chat	Feasibility testing for systems of real quadratic equations	1993	Alexander Barvinok	4
+ PDF Chat	Structured low-rank approximation and its applications	2008	Ivan Markovsky	4
+	Polynomial-time computing over quadratic maps i: sampling in real algebraic sets	2005	Dima Grigoriev Dmitrii V. Ṗasechnik	4
+	The geometric and numerical properties of duality in projective algebraic geometry	1988	Audun Holme	4
+	Introduction to Singularities and Deformations	2008	Gert–Martin Greuel Eugeniĭ Shustin Christoph Lossen	4
+	Introduction to Toric Varieties.	1993	William Fulton	3
+	Solving Zero-Dimensional Systems Through the Rational Univariate Representation	1999	Fabrice Rouillier	3
+	Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes	1972	Melvin Hochster	3
+ PDF Chat	Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets	2015	Ivan Bannwarth Mohab Safey El Din	3
+	Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases	2009	Jean‐Charles Faugère Sajjad Rahmany	3
+ PDF Chat	On the Complexity of Computing Critical Points with Gröbner Bases	2014	Pierre-Jean Spaenlehauer	3
+ PDF Chat	A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets	2014	Saugata Basu Marie-Françoise Roy Mohab Safey El Din Éric Schost	3
+	The Magma Algebra System I: The User Language	1997	Wieb Bosma John Cannon Catherine Playoust	3
+ PDF Chat	Degeneracy Loci and Polynomial Equation Solving	2014	Bernd Bank M Giusti Joos Heintz Grégoire Lecerf Guillermo Matera Pablo Solernó	3
+	Generalized polar varieties and an efficient real elimination	2004	Bernd Bank M Giusti Joos Heintz Luis Miguel Pardo	3
+	Computing the global optimum of a multivariate polynomial over the reals	2008	Mohab Safey El Din	3
+ PDF Chat	Polar varieties and efficient real elimination	2001	B. Bank M Giusti Joos Heintz G. M. Mbakop	3
+	Basic Algebraic Geometry 2	1994	Igor R. Shafarevich	3
+ PDF Chat	Divide and Conquer Roadmap for Algebraic Sets	2014	Saugata Basu Marie-Françoise Roy	3
+	Counting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology	2001	Kiran S. Kedlaya	3
+ PDF Chat	Description of the connected components of a semialgebraic set in single exponential time	1994	Joos Heintz Marie-Françoise Roy Pablo Solernó	3
+	A concise proof of the Kronecker polynomial system solver from scratch	2007	Clémence Durvye Grégoire Lecerf	3
+	Handbook of Elliptic and Hyperelliptic Curve Cryptography	2005	Henri Cohen Gerhard Frey Roberto Avanzi Christophe Doche Tanja Lange Kim Nguyễn Fréderik Vercauteren	3
+	SEMI-REGULAR RINGS AND SEMI-REGULAR IDEALS	1960	D. G. Northcott	3
+	Structured low rank approximation	2003	Moody T. Chu R. E. Funderlic Robert J. Plemmons	3