467 search results - page 20 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
104
click to vote
CASC
2007
Springer
15 years 3 months ago
2007
Springer
We consider summation of consecutive values (v), (v +1), . . . , (w) of a meromorphic function (z) where v, w ZZ. We assume that (z) satisfies a linear difference equation L(y) = ...
EOR
2008
14 years 11 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
STOC
1996
ACM
15 years 3 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
DLT
2009
14 years 9 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
JC
2011
14 years 6 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...