Sciweavers

740 search results - page 2 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 8 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev
ECCC
2010
122views more  ECCC 2010»
13 years 9 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
JC
1998
58views more  JC 1998»
13 years 10 months ago
Some Lower Bounds for the Complexity of Continuation Methods
Jean-Pierre Dedieu, Steve Smale