19 search results - page 1 / 4 » On the Complexity of Hilbert's 17th Problem |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
FOCM
2008
13 years 4 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
SIAMCO
2002
13 years 4 months ago
2002
This paper deals with linear shift-invariant distributed systems. By this we mean systems described by constant coefficient linear partial differential equations. We define dissipa...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
IPL
2011
12 years 11 months ago
2011
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...