Sciweavers

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

14

STOC
2003
ACM

favoriteEmaildiscussreport

118views Algorithms» more STOC 2003»

Exponential lower bound for 2-query locally decodable codes via a quantum argument

14 years 5 months ago

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Download homepages.cwi.nl

Iordanis Kerenidis, Ronald de Wolf

Real-time Traffic

Algorithms | Exponential Lower Bound | STOC 2003 |

claim paper

Related Content

» Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

» Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Iordanis Kerenidis, Ronald de Wolf

Comments (0)