2924 search results - page 80 / 585 » Lower Bounds in Distributed Computing |
PODC
1994
ACM
14 years 1 months ago
1994
ACM
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...