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 |
---|---|
Pages (from-to) | 975-990 |
Number of pages | 16 |
Journal | Discrete & computational geometry |
Volume | 70 |
Issue number | 3 |
Early online date | 5 Jul 2022 |
DOIs | |
Publication status | Published - 1 Oct 2023 |
Keywords / Materials (for Non-textual outputs)
- 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
-
New Approaches to Counting and Sampling
Guo, H. (Principal Investigator)
1/01/21 → 31/12/25
Project: Research