2924 search results - page 201 / 585 » Lower Bounds in Distributed Computing |
156
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
125
click to vote
CJTCS
1999
15 years 3 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
141
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
133
click to vote
MOC
2002
15 years 2 months ago
2002
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
136
Voted
TSP
2010
14 years 10 months ago
2010
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...