Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
type: Item
instance of: scholarly article
title: Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
zbMATH Open document ID: 0848.90123
DOI: 10.1007/BF02592095
author: U. Faigle
author: M. Streng
author: Walter Kern
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 894753
zbMATH Keywords: polytopes
zbMATH Keywords: polynomial time algorithms
zbMATH Keywords: polynomial inequalities
MaRDI profile type: Publication
cites work: The complexity of elementary algebra and geometry
cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
cites work: Q4863221
cites work: Chebyshev approximation of a point set by a straight line
cites work: Q5792485
full work available at URL: https://doi.org/10.1007/bf02592095
OpenAlex ID: W1556094370
description: scientific article; zbMATH DE number 894753