搜索结果: 1-1 共查到“离散数学 POLYGONS”相关记录1条 . 查询时间(0.047 秒)
Abstract: The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the...