The PCP-like Theorem for Sub-linear Time Inapproximability

TL;DR

This paper introduces a PCP-like theorem for sub-linear time inapproximability, extending previous frameworks by developing new reductions and hardness classes based on SETH, to prove sub-linear time hardness results.

Contribution

It proposes a novel PCP-like theorem for sub-linear time inapproximability, introduces Ext-reduction, and defines new hardness classes for problems hard to approximate sub-linearly.

Findings

Established a new framework for sub-linear time inapproximability

Developed Ext-reduction technique for hardness proofs

Identified problems in the new hardness class

Abstract

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.