arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9204233math.MGmath.CO
收藏

A quasi-polynomial bound for the diameter of graphs of polyhedra

Gil Kalai, Daniel J. Kleitman

英文摘要:

The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑