arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.01520cs.CC
收藏

亚线性时间不可近似性的类PCP定理

The PCP-like Theorem for Sub-linear Time Inapproximability

Hengzhao Ma, Jianzhong Li

AI总结:

本文提出用于亚线性时间不可近似性的类PCP定理,基于SETH找到Ext-$k$-SAT问题并设计类MA协议,提出新型Ext-reduction归约,定义两个新硬度类,证明部分问题属于该类。

摘要:

本文提出了用于亚线性时间不可近似性的类PCP定理。Abboud等人设计了分布式PCP框架以证明亚二次时间不可近似性。本文在此基础上进一步探索该方向。从SETH出发,首先找到一个记为Ext-$k$-SAT的问题,该问题无法在亚线性时间内计算,随后为其设计了一个高效的类MA协议。为利用该协议证明其他问题的亚线性时间不可近似性,本文设计了一种称为Ext-reduction的新型归约,它与现有归约技术不同。本文还定义了两个新的硬度类,其中的问题可在亚线性时间内计算,但无法在亚线性时间内被高效近似。部分问题被证明属于新定义的硬度类。

英文摘要:

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inapproximability. Here we try to go further in this direction. Staring from SETH, we first find a problem denoted as Ext-$k$-SAT, which can not be computed in linear time, then devise an efficient MA-like protocol for this problem. To use this protocol to prove the sub-linear time inapproximability of other problems, we devise a new kind of reduction denoted as Ext-reduction, and it is different from existing reduction techniques. We also define two new hardness class, the problems in which can be computed in linear-time, but can not be efficiently approximated in sub-linear time. Some problems are shown to be in the newly defined hardness class.

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

↑