Get started
Author

Pierre-Jean Spaenlehauer

On the complexity of solving quadratic Boolean systems
2012 · Magali Bardet, Jean-Charles Faugère, et al. · Journal of Complexity · 100
PDF
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
2010 · Jean-Charles Faugère, Mohab Safey El Din, et al. · International Symposium on Symbolic and Algebraic Computation · 90
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, et al. · Journal of Symbolic Computation · 88
PDF
On the complexity of the generalized MinRank problem
2013 · Jean-Charles Faugère, Mohab Safey El Din, et al. · Journal of Symbolic Computation · 65
PDF
Exact Solutions in Structured Low-Rank Approximation
2014 · Giorgio Ottaviani, Pierre-Jean Spaenlehauer, et al. · SIAM Journal on Matrix Analysis and Applications · 49
PDF
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
2015 · Éric Schost, Pierre-Jean Spaenlehauer · Foundations of Computational Mathematics · 30
PDF
On the Complexity of Computing Critical Points with Gröbner Bases
2014 · Pierre-Jean Spaenlehauer · SIAM Journal on Optimization · 29
PDF
Critical points and Gröbner bases: the unmixed case
2012 · Jean-Charles Faugère, Mohab Safey El Din, et al. · International Symposium on Symbolic and Algebraic Computation · 27
PDF
Sparse Gröbner bases: the unmixed case
2014 · Jean-Charles Faugère, Pierre-Jean Spaenlehauer, et al. · International Symposium on Symbolic and Algebraic Computation · 21
PDF
Critical Points and Gr\"obner Bases: the Unmixed Case
2012 · Jean‐Charles Faugère, Mohab Safey El Din, et al. · arXiv (Cornell University) · 18
A Polyhedral Method for Sparse Systems with Many Positive Solutions
2018 · Frédéric Bihan, Francisco Santos, et al. · SIAM Journal on Applied Algebra and Geometry · 16
PDF
A fast randomized geometric algorithm for computing Riemann-Roch spaces
2020 · Aude Le Gluher, Pierre-Jean Spaenlehauer · Mathematics of Computation · 15
PDF
Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem
2010 · Jean-Charles Faugère, Pierre-Jean Spaenlehauer · Lecture notes in computer science · 15
PDF
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds
2016 · Mohab Safey El DIn, Pierre-Jean Spaenlehauer · International Symposium on Symbolic and Algebraic Computation · 14
PDF
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
2018 · Simon Abelard, Pierrick Gaudry, et al. · Foundations of Computational Mathematics · 10
PDF
Counting points on genus-3 hyperelliptic curves with explicit real multiplication
2019 · Simon Abelard, Pierrick Gaudry, et al. · The Open Book Series · 8
PDF
Algebraic-Differential Cryptanalysis of DES
2009 · Jean-charles Faugère, Ludovic Perret, et al. · 6
Computing a group action from the class field theory of imaginary hyperelliptic function fields
2024 · Antoine Leudière, Pierre-Jean Spaenlehauer · Journal of Symbolic Computation · 5
PDF
Dimension results for extremal-generic polynomial systems over complete toric varieties
2024 · Matías Bender, Pierre-Jean Spaenlehauer · Journal of Algebra · 4
PDF
Newton-like iteration for determinantal systems and structured low rank approximation
2014 · Éric Schost, Pierre-Jean Spaenlehauer · ACM communications in computer algebra · 3
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
2020 · Gluher, Aude Le, Spaenlehauer, Pierre-Jean, et al. · arXiv (Cornell University) · 2
PDF
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
2016 · Jean-Charles Faugère, Pierre-Jean Spaenlehauer, et al. · International Symposium on Symbolic and Algebraic Computation · 2
PDF
Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes
2015 · Bihan, Frédéric, Spaenlehauer, Pierre-Jean · arXiv (Cornell University) · 2
PDF
Computing Isomorphisms between Products of Supersingular Elliptic Curves
2025 · Gaudry, Pierrick, Soumier, Julien, et al. · HAL · 1
PDF
Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case.
2013 · Pierre-Jean Spaenlehauer · arXiv (Cornell University) · 1
Works count: 40
Citation count: 621
H-index: 14
I10-index: 15
Year
Topic
Type