A new reduction converts constant-gap PCPs from imperfect to perfect completeness with small overhead and proves equivalence of Gap-ETH variants with and without perfect completeness.
Some optimal inapproximability results
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2verdicts
UNVERDICTED 2representative citing papers
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.
citing papers explorer
-
Imperfect Gaps in Gap-ETH and PCPs
A new reduction converts constant-gap PCPs from imperfect to perfect completeness with small overhead and proves equivalence of Gap-ETH variants with and without perfect completeness.
-
Equations over Finite Monoids with Infinite Promises
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.