Note on the computational complexity of j -radii of polytopes in ℝn

Faigle, U. and Kern, W. and Streng, M. (1996) Note on the computational complexity of j -radii of polytopes in ℝn. Mathematical programming, 73 (1). pp. 1-5. ISSN 0025-5610

Preview

PDF
212Kb

Abstract:	We show that, for fixed dimensionn, the approximation of inner and outer j-radii of polytopes in ℝn, endowed with the Euclidean norm, is in ℙ. Our method is based on the standard polynomial time algorithms for solving a system of polynomial inequalities over the reals in fixed dimension.
Item Type:	Article
Copyright:	© 1996 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/79988
Official URL:	http://dx.doi.org/10.1007/BF02592095
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 140762