线性离散度为$Π_2$ -难以近似
Linear Discrepancy is $Π_2$-Hard to Approximate
摘要:
本文证明了计算给定矩阵的线性差的问题是$Π_2$ -困难的,甚至对于任何$ε> 0$,在$9/8 - ε$因子内也是如此.这强化了Li和Nikolov [ESA 2020]针对该问题的确切版本的NP难度结果,并回答了他们提出的问题。此外,由于Li和Nikolov证明了该问题包含在$Π_2$中,我们的结果使得线性偏差成为另一个自然的问题,即$Π_2$ -完全(近似)的问题.
英文摘要:
In this note, we prove that the problem of computing the linear discrepancy of a given matrix is $Π_2$-hard, even to approximate within $9/8 - ε$ factor for any $ε> 0$. This strengthens the NP-hardness result of Li and Nikolov [ESA 2020] for the exact version of the problem, and answers a question posed by them. Furthermore, since Li and Nikolov showed that the problem is contained in $Π_2$, our result makes linear discrepancy another natural problem that is $Π_2$-complete (to approximate).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。