Under the auspices of the Computational Complexity Foundation (CCF)
We show that, for fixed dimension n, the approximation of inner and outer j-radii of polytopes in {\Re}^n, endowed with the Euclidean norm, is polynomial.