Counting vertices of integer polytopes defined by facets

05/04/2021

∙

by   Heng Guo, et al.

∙

0

∙

share

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.