Counting Vertices of Integral Polytopes Defined by Facets

Discrete & Computational Geometry（2022）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

关键词

0,1 polytopes,Approximation algorithms,Computational complexity of counting,Totally unimodular matrices

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要