Sciweavers

JC
2008
92views more  JC 2008»
13 years 5 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier
JC
2008
77views more  JC 2008»
13 years 5 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...