The PCP-like Theorem for Sub-linear Time Inapproximability

07/04/2021
by   Hengzhao Ma, et al.
0

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.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/04/2020

PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inappr...
11/04/2020

Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism

We present implications from the known conjectures like APSP, 3SUM and E...
11/17/2020

Optimizing Offer Sets in Sub-Linear Time

Personalization and recommendations are now accepted as core competencie...
11/17/2021

Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth

Floyd and Knuth investigated in 1990 register machines which can add, su...
09/21/2019

Efficient Learning of Distributed Linear-Quadratic Controllers

In this work, we propose a robust approach to design distributed control...
02/10/2022

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

We study linear equations in combinatorial Laplacians of k-dimensional s...
07/24/2020

Tromino Tilings with Pegs via Flow Networks

A tromino tiling problem is a packing puzzle where we are given a region...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.