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

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

0.00 Avg rating0 Votes
Article ID: iaor19972011
Country: Netherlands
Volume: 73
Issue: 1
Start Page Number: 1
End Page Number: 5
Publication Date: Apr 1996
Journal: Mathematical Programming (Series A)
Authors: , ,
Abstract:

The authors show that, for fixed dimension n, the approximation of inner and outer j-radii of polytopes in ℝ’n, endowed with the Euclidean norm, is in ℝ. The present method is based on the standard polynomial time algorithms for solving a system of polynomial inequalities over the reals in fixed dimension.

Reviews

Required fields are marked *. Your email address will not be published.