Projects per year
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.
Original language | English |
---|---|
Number of pages | 16 |
Journal | Discrete & computational geometry |
Early online date | 5 Jul 2022 |
DOIs | |
Publication status | E-pub ahead of print - 5 Jul 2022 |
Keywords
- 0/1 polytopes
- approximation algorithms
- computational complexity of counting
- totally unimodular matrices
Fingerprint
Dive into the research topics of 'Counting vertices of integral polytopes defined by facets'. Together they form a unique fingerprint.Projects
- 1 Active