138 citations · 509 across the 16 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2013★ 19 cited
On the Complexity of the F5 Gröbner basis Algorithm
Magali Bardet, Jean-Charles Faugère, Bruno Salvy
We study the complexity of Gröbner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We…
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…