2681 search results - page 67 / 537 » Problem F |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
EJC
2006
13 years 9 months ago
2006
Let g(n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, . . . , n} so that given a union of at most r members of F, one can identify at least one of the...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...