NOTE ON THE COMPUTATIONAL COMPLEXITY OF J-RADII OF POLYTOPES IN R(N)

摘要

We show that, for fixed dimension n, the approximation of inner and outer j-radii of polytopes in R(n), endowed with the Euclidean norm, is in P. Our method is based on the standard polynomial time algorithms for solving a system of polynomial inequalities over the reals in fixed dimension. [References: 8]