中文

布尔立方体子集分离多面体的扩展复杂度

计算几何 2021-05-26 v1 计算复杂性

摘要

我们证明:1. 对任意 A{0,1}nA\subseteq \{0, 1\}^n,存在多面体 PRnP\subseteq \mathbb{R}^n 满足 P{0,1}n=AP \cap \{0, 1\}^n = A 且扩展复杂度(extension complexity)为 O(2n/2)O(2^{n/2});2. 存在某个 A{0,1}nA\subseteq \{0, 1\}^n,使得任意满足 P{0,1}n=AP\cap \{0, 1\}^n = APP 的扩展复杂度至少为 2n3(1o(1))2^{\frac{n}{3}(1-o(1))}。我们还指出,Rn\mathbb{R}^n 中任意 0/1-多面体的扩展复杂度至多为 O(2n/n)O(2^n/n),并提出如下问题:上界能否改进为对某个 c<1c<1O(2cn)O(2^{cn})

关键词

引用

@article{arxiv.2105.11996,
  title  = {On the extension complexity of polytopes separating subsets of the Boolean cube},
  author = {Pavel Hrubeš and Navid Talebanfard},
  journal= {arXiv preprint arXiv:2105.11996},
  year   = {2021}
}