In theoretical computer science, combinatorial reconfiguration studies transformations between feasible solutions. The study focuses on approximating reconfigurability, relaxing feasibility constraints. Ohsaka's work demonstrates that many reconfiguration problems are PSPACE-hard to approximate under RIH. The paper introduces gap amplification techniques for popular reconfiguration problems, proving explicit factors of inapproximability. Results show Maxmin 2-CSP Reconfiguration is PSPACE-hard to approximate within a factor of 0.9942 under RIH. The proof involves expanderization and powering steps adapted from previous works like Dinur's PCP theorem proof.
To Another Language
from source content
arxiv.org
Ключові висновки, отримані з
by Naoto Ohsaka о arxiv.org 03-19-2024
https://arxiv.org/pdf/2310.14160.pdfГлибші Запити