93 citations · 692 across the 41 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★ 1 cited
On Kahan's Rules for Determining Branch Cuts
Frédéric Chyzak, James Davenport, Christoph Koutschan +1
In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compa…