Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)

DOI10.1007/BF02592095zbMath0848.90123OpenAlexW1556094370MaRDI QIDQ1915805

M. Streng, Ulrich Faigle, Walter Kern

Publication date: 28 July 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592095

zbMATH Keywords

polytopespolynomial inequalitiespolynomial time algorithms

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

On the complexity of some basic problems in computational convexity. I. Containment problems, Efficient subspace approximation algorithms, Fast subspace approximation via greedy least-squares, Lines tangent to $2n-2$ spheres in ${\mathbb R}^n$

Cites Work

• The complexity of elementary algebra and geometry
• Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
• Chebyshev approximation of a point set by a straight line
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Unnamed Item
• Unnamed Item