Counting vertices of integral polytopes defined by facets
Computational Complexity
2022-05-04 v2 Combinatorics
Abstract
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and half-integral polytopes.
Keywords
Cite
@article{arxiv.2105.01469,
title = {Counting vertices of integral polytopes defined by facets},
author = {Heng Guo and Mark Jerrum},
journal= {arXiv preprint arXiv:2105.01469},
year = {2022}
}
Comments
15 pages. Minor edits, including a small change to the title. This version is accepted for publication in Discrete and Computational Geometry