Projects per year
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.
|Number of pages||16|
|Journal||Discrete & computational geometry|
|Early online date||5 Jul 2022|
|Publication status||E-pub ahead of print - 5 Jul 2022|
- 0/1 polytopes
- approximation algorithms
- computational complexity of counting
- totally unimodular matrices
FingerprintDive into the research topics of 'Counting vertices of integral polytopes defined by facets'. Together they form a unique fingerprint.
- 1 Active
New Approaches to Counting and Sampling
1/01/21 → 31/12/25