388 search results - page 37 / 78 » Quantum Lower Bounds by Polynomials |
CPM
2010
Springer
14 years 6 days 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...
ML
2002
ACM
13 years 7 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...
ICTCS
2005
Springer
14 years 27 days 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...
TCS
2011
13 years 2 months 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...
CCCG
1998
13 years 8 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...