JC 2008 | Sciweavers

40

JC
2008

92views more JC 2008»

Characterizing Valiant's algebraic complexity classes

13 years 11 months ago

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

claim paper

Read More »

33

click to vote

JC
2008

77views more JC 2008»

A numerical algorithm for zero counting, I: Complexity and accuracy

13 years 11 months ago

Download mate.dm.uba.ar

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, ...

claim paper

Read More »

23

click to vote

JC
2008

43views more JC 2008»

On the probabilistic complexity of finding an approximate solution for linear programming

13 years 11 months ago

Download www.optimization-online.org

Jun Ji, Florian A. Potra

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers