Arrow Research search
Back to FOCS

FOCS 2005

Nonembeddability theorems via Fourier analysis

Conference Paper Session 2: Best Paper Award Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Various new nonembeddability results (mainly into L/sub 1/) are proved via Fourier analysis. In particular, it is shown that the edit distance on {0, 1}/sup d/ has L/sub 1/ distortion (log d)/sup 1/2 - o(1)/. We also give new lower bounds on the L/sub 1/ distortion of quotients of the discrete hypercube under group actions, and the transportation cost (Earthmover) metric.

Authors

Keywords

  • Extraterrestrial measurements
  • Hypercubes
  • Harmonic analysis
  • Transportation
  • Costs
  • Computer science
  • Educational institutions
  • Surges
  • Computational geometry
  • Approximation algorithms
  • Fourier Analysis
  • Distortion
  • Lower Bound
  • Quotient
  • Transportation Costs
  • Edit Distance
  • Shortest Path
  • Computational Biology
  • Banach Space
  • Nearest Neighbor Search
  • Linear Subspace
  • Hausdorff Distance
  • Shortest Path Distance
  • Cost Metrics

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
391964363522201284
v2026.09.13