On recognizing integer polyhedra
From MaRDI portal
Publication:2639642
DOI10.1007/BF02122701zbMath0718.68044MaRDI QIDQ2639642
Mihalis Yannakakis, Christos H. Papadimitriou
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On the complexity of some basic problems in computational convexity. I. Containment problems, Unnamed Item, Largest \(j\)-simplices in \(n\)-polytopes, Counting vertices of integral polytopes defined by facets, Characterizing and recognizing generalized polymatroids, The negative cycles polyhedron and hardness of checking some polyhedral properties, Box-total dual integrality, box-integrality, and equimodular matrices, When Is the Matching Polytope Box-Totally Dual Integral?, The strong perfect graph conjecture: 40 years of attempts, and its resolution
Cites Work
