6 citations · 7 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012
On the intrinsic complexity of elimination problems in effective Algebraic Geometry
Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the…
cs.CC2011★ 1 cited
Software Engineering and Complexity in Effective Algebraic Geometry
Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a comput…