93 citations · 154 across the 14 of their papers we have counts for
Showing 2011 · cs.SCShow all
2 papers · 2 filters
cs.SC2011★ 93 cited
On the Complexity of Solving Quadratic Boolean Systems
Magali Bardet, Jean-Charles Faugère, Bruno Salvy +1
A fundamental problem in computer science is to find all the common zeroes of quadratic polynomials in unknowns over . The cryptanalysis of several modern cip…
cs.SC2011★ 3 cited
On the Complexity of the Generalized MinRank Problem
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most . A natu…