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

The computational complexity of convex bodies

Alexander Barvinok, Ellen Veomett

英文摘要:

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in d). We discuss approximations of a convex body by an ellipsoid, by an algebraic hypersurface, by a projection of a polytope with a controlled number of facets, and by a section of the cone of positive semidefinite quadratic forms. We illustrate some of the results on the Traveling Salesman Polytope, an example of a complicated convex body studied in combinatorial optimization.

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

↑