To print higher-resolution math symbols, click the
Hi-Res Fonts for Printing button on the jsMath control panel.

jsMath
Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > M. STRENG:
All reports by Author M. Streng:

TR95-014 | 27th January 1995
U. Faigle, W. Kern, M. Streng

Note On the Computational Complexity of j-Radii of Polytopes in {\Re}^n

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.

more >>>



ISSN 1433-8092 | Imprint