The Complexity of Geometric Problems in High Dimension

DOI10.1007/978-3-642-13562-0_5zbMath1284.68283OpenAlexW1871232634MaRDI QIDQ3569062

Christian Knauer

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_5

zbMATH Keywords

lower boundsparameterized complexitygeometric dimensionexponential-time hypothesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A combinatorial branch-and-bound algorithm for box search ⋮ Fixed-parameter complexity and approximability of norm maximization

This page was built for publication: The Complexity of Geometric Problems in High Dimension