\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
type: Item
instance of: scholarly article
title: \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
zbMATH Open document ID: 1018.52010
author: Asa Packer
published in: Discrete \& Computational Geometry
publication date: 2002-12-01T00:00:00Z
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1837072
zbMATH Keywords: computational convexity
zbMATH Keywords: \(d\)-simplex
zbMATH Keywords: \(V\)-polytope
zbMATH Keywords: \(H\)-polytopes
zbMATH Keywords: \(\mathbb{N}\mathbb{P}\)-hardness
zbMATH Keywords: truncated simplex
MaRDI profile type: Publication
full work available at URL: s00454-002-0745-8
OpenAlex ID: W2026302893
DOI: 10.1007/S00454-002-0745-8
description: scientific article; zbMATH DE number 1837072