NNS Lower Bounds via Metric Expansion for l ∞ and EMD
From MaRDI portal
Publication:2843279
DOI10.1007/978-3-642-31594-7_46zbMath1272.68117OpenAlexW1581927269MaRDI QIDQ2843279
Michael Kapralov, Rina Panigrahy
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_46
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
This page was built for publication: NNS Lower Bounds via Metric Expansion for l ∞ and EMD