Towards Hardness of Approximation for Polynomial Time Problems
- aStanford University, Stanford, United States
- bMassachusetts Institute of Technology, Cambridge, United States
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
Proving hardness of approximation is a major challenge in the field of fine-grained complexity and conditional lower bounds in P. How well can the Longest Common Subsequence (LCS) or the Edit Distance be approximated by an algorithm that runs in near-linear time? In this paper, we make progress towards answering these questions. We introduce a framework that exhibits barriers for truly subquadratic and deterministic algorithms with good approximation guarantees. Our framework highlights a novel connection between deterministic approximation algorithms for natural problems in P and circuit lower bounds. In particular, we discover a curious connection of the following form: if there exists a \delta>0 such that for all \eps>0 there is a deterministic (1+\eps)-approximation algorithm for LCS on two sequences of length n over an alphabet of size n^{o(1)} that runs in O(n^{2-\delta}) time, then a certain plausible hypothesis is refuted, and the class E^NP does not have non-uniform linear size Valiant Series-Parallel circuits. Thus, designing a "truly subquadratic PTAS" for LCS is as hard as resolving an old open question in complexity theory.
TL;DRA framework that exhibits barriers for truly subquadratic and deterministic algorithms with good approximation guarantees is introduced and highlights a novel connection between deterministic approximation algorithms for natural problems in P and circuit lower bounds. (Semantic Scholar)