Estimating the number of vertices of a polyhedron
type: Item
instance of: scholarly article
title: Estimating the number of vertices of a polyhedron
zbMATH Open document ID: 1014.68200
DOI: 10.1016/S0020-0190(00)00011-9
author: David Avis
author: Luc Devroye
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1771751
zbMATH Keywords: polyhedron
zbMATH Keywords: tree estimation methods
describes a project that uses: ZRAM
describes a project that uses: cdd
MaRDI profile type: Publication
cites work: Q4188659
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Q4935168
cites work: Reverse search for enumeration
cites work: The parallel search bench ZRAM and its applications
cites work: An optimal convex hull algorithm in any fixed dimension
cites work: Q4079613
cites work: McMullen's conditions and some lower bounds for general convex polytopes
cites work: Q3772828
cites work: Q3142504
cites work: Combinatorial Analysis and Computers
cites work: Estimating the Efficiency of Backtrack Programs
cites work: Q5817857
full work available at URL: s0020-0190(00)00011-9
OpenAlex ID: W2123276592
description: scientific article; zbMATH DE number 1771751