On the \(k\)-systems of a simple polytope

DOI10.1007/BF02773157zbMath1009.52021arXivmath/0012204WikidataQ117245117 ScholiaQ117245117MaRDI QIDQ1601467

Michael Joswig, Volker Kaibel, Friederike Körner

Publication date: 4 April 2003

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0012204

zbMATH Keywords

algorithmic complexity; simple polytope; edge graph; abstract objective function

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)