Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-014 | 27th January 1995 00:00

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

RSS-Feed




TR95-014
Authors: U. Faigle, W. Kern, M. Streng
Publication: 1st March 1995 11:54
Downloads: 1286
Keywords: 


Abstract:

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.



ISSN 1433-8092 | Imprint