Spaenlehauer, Pierre-Jean

1. On the Complexity of the Generalized MinRank Problem
   2011/12/19 by Jean‐Charles Faugère, Mohab Safey El Din, Faugère, Jean-Charles +3 · 3 citations
   Computer Science · Mathematics · #13P10 #13P15 #68W30 #68W40 #Commutative Algebra and Its Applications #FOS: Computer and information sciences #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #Tensor decomposition and applications
2. A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
   2013/12/27 by Schost, Éric, Spaenlehauer, Pierre-Jean · 1 citation
   #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA) #Symbolic Computation (cs.SC)
3. Critical Point Computations on Smooth Varieties: Degree and Complexity bounds
   2016/05/09 by Mohab Safey El Din, Din, Mohab Safey El, Pierre-Jean Spaenlehauer +1 · 1 citation
   Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Commutative Algebra and Its Applications #FOS: Computer and information sciences #Polynomial and algebraic computation #Symbolic Computation (cs.SC)
4. Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
   2017/10/10 by Simon Abelard, Abelard, Simon, Pierrick Gaudry +3 · 1 citation
   Computer Science · Mathematics · #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #Symbolic Computation (cs.SC)