Using a parallelization trick, the authors show that q-query PCPPs with soundness 1-epsilon directly imply PSPACE-hardness of (q+1)-CSP reconfiguration with soundness gap 1-epsilon, removing the prior factor-4 loss.
Probabilistic checking of proofs: A new characterization of NP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs
Using a parallelization trick, the authors show that q-query PCPPs with soundness 1-epsilon directly imply PSPACE-hardness of (q+1)-CSP reconfiguration with soundness gap 1-epsilon, removing the prior factor-4 loss.