Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) |
scientific article; zbMATH DE number 894753
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) |
scientific article; zbMATH DE number 894753 |
Statements
Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (English)
0 references
28 July 1996
0 references
polytopes
0 references
polynomial time algorithms
0 references
polynomial inequalities
0 references
0 references
