Jean‐Charles Faugère

1. On the Complexity of the Generalized MinRank Problem
   2011/12/19 by Jean‐Charles Faugère, Faugère, Jean-Charles, Mohab Safey El Din +3 · 2 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. On the Complexity of the F5 Gröbner basis Algorithm
   2013/12/05 by Magali Bardet, Bardet, Magali, Jean‐Charles Faugère +3 · 2 citations
   Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Commutative Algebra and Its Applications #FOS: Computer and information sciences #Polynomial and algebraic computation #Symbolic Computation (cs.SC)
3. Polynomial Systems Solving by Fast Linear Algebra
   2013/04/22 by Jean‐Charles Faugère, Pierrick Gaudry, Faugère, Jean-Charles +5 · 1 citation
   Computer Science · Mathematics · #Commutative Algebra and Its Applications #FOS: Computer and information sciences #Formal Methods in Verification #Polynomial and algebraic computation #Symbolic Computation (cs.SC)
4. A survey on signature-based Gröbner basis computations
   2014/04/07 by Christian Eder, Eder, Christian, Jean‐Charles Faugère +1 · 1 citation
   Computer Science · Engineering · #Polynomial and algebraic computation #Cryptography and Residue Arithmetic #Advanced Numerical Analysis Techniques