388 search results - page 37 / 78 » Quantum Lower Bounds by Polynomials |
168
click to vote
CPM
2010
Springer
15 years 10 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
152
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
154
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
215
click to vote
TCS
2011
15 years 27 days ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
173
click to vote
CCCG
1998
15 years 7 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...