3208 search results - page 25 / 642 » A Lower Bound for Primality |
184
click to vote
COCO
2009
Springer
16 years 2 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
154
click to vote
COCO
2009
Springer
16 years 2 days ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
148
Voted
FOCS
2007
IEEE
15 years 12 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
143
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a ...
149
click to vote
STOC
1991
ACM
15 years 9 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...