352 search results - page 50 / 71 » Proofs as Polynomials |
JC
2008
14 years 10 months ago
2008
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...
64
Voted
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
79
Voted
MICS
2010
14 years 8 months ago
2010
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
88
Voted
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...