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.
A birthday re petition theorem and complexity of approximating dense csps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
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.