activity
20232025
most citedOn Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.CC2025

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs

Venkatesan Guruswami, Xuandi Ren, Kewen Wu

The Reconfiguration Inapproximability Hypothesis (RIH), recently established by Hirahara-Ohsaka (STOC'24) and Karthik-Manurangsi (ECCC'24), studies the hardness of reconfiguring on…