Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

Voted

APPROX
2010
Springer

123views Algorithms» more APPROX 2010»

Better Gap-Hamming Lower Bounds via Better Round Elimination

15 years 4 months ago

Better Gap-Hamming Lower Bounds via Better Round Elimination

Download www.cs.dartmouth.edu

Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas

Real-time Traffic

Algorithms | APPROX 2010 |

claim paper

Related Content

» Spherical Cubes and Rounding in High Dimensions

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Finding Isolated Cliques by Queries An Approach to Fault Diagnosis with Many Faults

» Integrality gaps for SheraliAdams relaxations

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf

Comments (0)