On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results

Recently, Ohsaka [STACS'23] put forth the Reconfiguration Inapproximability Hypothesis (RIH), which roughly asserts that there is some $ε>0$ such that given as input a $k$-CSP instance (for some constant $k$) over some constant sized alphabet, and two satisfying assignments $ψ_s$ and $ψ_t$, it is PSPACE-hard to find a sequence of assignments starting from $ψ_s$ and ending at $ψ_t$ such that every assignment in the sequence satisfies at least $(1-ε)$ fraction of the constraints and also that every assignment in the sequence is obtained by changing its immediately preceding assignment (in the sequence) on exactly one variable. Assuming RIH, many important reconfiguration problems have been shown to be PSPACE-hard to approximate by Ohsaka [STACS'23; SODA'24]. In this paper, we provide a proof of RIH. Our proof uses known constructions of PCP of Proximity to create the gap, and further leverages a parallelization framework from recent parameterized inapproximability results to analyze the quantitative trade-off between $ε$ and $k$ in RIH. We note that Hirahara and Ohsaka [STOC'24] have also independently proved RIH. We also prove that the aforementioned $k$-CSP Reconfiguration problem is NP-hard to approximate to within a factor of $1/2 + ε$ (for any $ε>0$) when $k=2$. We complement this with a polynomial time $(1/2 - ε)$-approximation algorithm, which improves upon a $(1/4 - ε)$-approximation algorithm of Ohsaka [2023] (again for any $ε>0$). Finally, we show that Set Cover Reconfiguration is NP-hard to approximate to within a factor of $2 - ε$ for any constant $ε> 0$, which matches the simple linear-time 2-approximation algorithm by Ito et al. [TCS'11].