Lower bounds for edit distance and product metrics via Poincaré-type inequalities

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 184-192

  Andoni, Alexandr ^a   Jayram, T S ^b   Pǎtraşcu, Mihai ^c  

^a PRINCETON UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMMUNICATION COMPLEXITY; EDIT DISTANCE; INFORMATION COMPLEXITY; LOWER BOUNDS; MAX-PRODUCT; NOVEL TECHNIQUES; PRODUCT METRICS; TWO WAY COMMUNICATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 77951677303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.17     Document Type: Conference Paper

References (20)

1. +03] Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, and Sofya Raskhodnikova. Lower bounds for embedding edit distance into normed spaces. In SODA, pages 523-526, 2003.
2. 1 non-embeddability barrier: Algorithms for product metrics. In SODA, pages 865-874, 2009.
3. [AK07] Alexandr Andoni and Robert Krauthgamer. The computational hardness of estimating edit distance. In FOCS, pages 724-734, 2007.
4. Accepted to SIAM Journal on Computing (FOCS'07 special issue).
5. [AO09] Alexandr Andoni and Krzysztof Onak. Approximating edit distance in near-linear time. In STOC, pages 199-204, 2009.
6. [BJKS04] Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
7. [CSWY01] A. Chakrabarti, Y. Shi, A. Wirth, and A. C-C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 270-278, 2001.
8. [DD06] Michel Deza and Elena Deza. Dictionary of Distances. Elsevier Science, 2006.
9. [Ind01] P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. In FOCS, pages 10-33, 2001.
10. [Jay09] T.S. Jayram. Hellinger strikes back: A note on the multi-party information complexity of AND. In RANDOM, 2009. To Appear.
11. [JW09] T.S. Jayram and David Woodruff. The data stream space complexity of cascaded norms. In FOCS, 2009. To appear.
12. [KN06] Subhash Khot and Assaf Naor. Nonembeddability theorems via fourier analysis. Math. Ann., 334(4):821-852, 2006. Preliminary version appeared in FOCS'05.
13. [KOR00] E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput, 30(2):457-474, 2000. Preliminary version appeared in STOC'98.
14. 1. In SODA, pages 1010-1017, 2006.
15. [KS92] Bala Kalyanasundaram and Georg Schnitger. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math., 5(4):545-557, 1992.
16. [LLR95] Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
17. [Mat02] Jiri Matousek. Lectures on Discrete Geometry. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2002.
18. [Mat07] J. Matoušek. Collection of open problems on low-distortion embeddings of finite metric spaces, March 2007. Available online. Last access in August, 2007.
19. [OR05] R. Ostrovsky and Y. Rabani. Low distortion embeddings for edit distance. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 218-224, 2005.
20. [Raz92] A. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.