Alphabet Reduction for Reconfiguration Problems

Author Naoto Ohsaka



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.113.pdf
  • Filesize: 1.07 MB
  • 17 pages

Document Identifiers

Author Details

Naoto Ohsaka
  • CyberAgent, Inc., Tokyo, Japan

Acknowledgements

I wish to thank Shuichi Hirahara for helpful conversations, and thank the anonymous referees for letting me know a simple construction of an assignment tester due to O'Donnell [{O'Donnell}, 2014] and for their suggestions which help improve the presentation of this paper.

Cite AsGet BibTex

Naoto Ohsaka. Alphabet Reduction for Reconfiguration Problems. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 113:1-113:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.113

Abstract

We present a reconfiguration analogue of alphabet reduction à la Dinur (J. ACM, 2007) and its applications. Given a binary constraint graph G and its two satisfying assignments ψ^ini and ψ^tar, the Maxmin 2-CSP Reconfiguration problem requests to transform ψ^ini into ψ^tar by repeatedly changing the value of a single vertex so that the minimum fraction of satisfied edges is maximized. We demonstrate a polynomial-time reduction from Maxmin 2-CSP Reconfiguration with arbitrarily large alphabet size W ∈ ℕ to itself with universal alphabet size W₀ ∈ ℕ such that 1) the perfect completeness is preserved, and 2) if any reconfiguration for the former violates ε-fraction of edges, then Ω(ε)-fraction of edges must be unsatisfied during any reconfiguration for the latter. The crux of its construction is the reconfigurability of Hadamard codes, which enables to reconfigure between a pair of codewords, while avoiding getting too close to the other codewords. Combining this alphabet reduction with gap amplification due to Ohsaka (SODA 2024), we are able to amplify the 1 vs. 1-ε gap for arbitrarily small ε ∈ (0,1) up to the 1 vs. 1-ε₀ for some universal ε₀ ∈ (0,1) without blowing up the alphabet size. In particular, a 1 vs. 1-ε₀ gap version of Maxmin 2-CSP Reconfiguration with alphabet size W₀ is PSPACE-hard given a probabilistically checkable reconfiguration proof system having any soundness error 1-ε due to Hirahara and Ohsaka (STOC 2024) and Karthik C. S. and Manurangsi (2023). As an immediate corollary, we show that there exists a universal constant ε₀ ∈ (0,1) such that many popular reconfiguration problems are PSPACE-hard to approximate within a factor of 1-ε₀, including those of 3-SAT, Independent Set, Vertex Cover, Clique, Dominating Set, and Set Cover. This may not be achieved only by gap amplification of Ohsaka, which makes the alphabet size gigantic depending on ε^-1.

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
  • Theory of computation → Error-correcting codes
Keywords
  • reconfiguration problems
  • hardness of approximation
  • Hadamard codes
  • alphabet reduction

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Dimitris Achlioptas, Amin Coja-Oghlan, and Federico Ricci-Tersenghi. On the solution-space geometry of random constraint satisfaction problems. Random Struct. Algorithms, 38(3):251-268, 2011. Google Scholar
  2. Noga Alon. Explicit expanders of every degree and size. Comb., 41(4):447-463, 2021. Google Scholar
  3. Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. Google Scholar
  4. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM J. Comput., 36(4):889-974, 2006. Google Scholar
  5. Amey Bhangale, Prahladh Harsha, Orr Paradise, and Avishay Tal. Rigid matrices from rectangular PCPs or: Hard claims have complex proofs. In FOCS, pages 858-869, 2020. Google Scholar
  6. Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, and Sebastian Siebertz. A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. CoRR, abs/2204.10526, 2022. URL: https://arxiv.org/abs/2204.10526.
  7. Irit Dinur. The PCP theorem by gap amplification. J. ACM, 54(3):12, 2007. Google Scholar
  8. Irit Dinur and Omer Reingold. Assignment testers: Towards a combinatorial proof of the PCP theorem. SIAM J. Comput., 36(4):975-1024, 2006. Google Scholar
  9. Lance Fortnow, John Rompel, and Michael Sipser. On the power of multi-prover interactive protocols. Theor. Comput. Sci., 134(2):545-557, 1994. Google Scholar
  10. David Gamarnik. The overlap gap property: A topological barrier to optimizing over random structures. Proc. Natl. Acad. Sci. U.S.A., 118(41):e2108492118, 2021. Google Scholar
  11. David Gamarnik and Madhu Sudan. Limits of local algorithms over sparse random graphs. Ann. Probab., 45(4):2353-2376, 2017. Google Scholar
  12. Johan Håstad. Clique is hard to approximate within n^1-ε. Acta Math., 182:105-142, 1999. Google Scholar
  13. Johan Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001. Google Scholar
  14. Shuichi Hirahara and Naoto Ohsaka. Probabilistically checkable reconfiguration proofs and inapproximability of reconfiguration problems. In STOC, 2024. to appear. Google Scholar
  15. Takehiro Ito and Erik D. Demaine. Approximability of the subset sum reconfiguration problem. J. Comb. Optim., 28(3):639-654, 2014. Google Scholar
  16. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno. On the complexity of reconfiguration problems. Theor. Comput. Sci., 412(12-14):1054-1065, 2011. Google Scholar
  17. Karthik C. S. and Pasin Manurangsi. On inapproximability of reconfiguration problems: PSPACE-hardness and some tight NP-hardness results. CoRR, abs/2312.17140, 2023. URL: https://arxiv.org/abs/2312.17140.
  18. Marc Mézard, Thierry Mora, and Riccardo Zecchina. Clustering of solutions in the random satisfiability problem. Phys. Rev. Lett., 94(19):197205, 2005. Google Scholar
  19. Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes. Explicit near-Ramanujan graphs of every degree. SIAM J. Comput., 51(3):STOC20-1-STOC20-23, 2021. Google Scholar
  20. C. M. Mynhardt and S. Nasserasr. Reconfiguration of colourings and dominating sets in graphs. In 50 years of Combinatorics, Graph Theory, and Computing, pages 171-191. CRC Press, 2019. Google Scholar
  21. Naomi Nishimura. Introduction to reconfiguration. Algorithms, 11(4):52, 2018. Google Scholar
  22. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014. Google Scholar
  23. Naoto Ohsaka. Gap preserving reductions between reconfiguration problems. In STACS, pages 49:1-49:18, 2023. Google Scholar
  24. Naoto Ohsaka. On approximate reconfigurability of label cover. CoRR, abs/2304.08746, 2023. URL: https://arxiv.org/abs/2304.08746.
  25. Naoto Ohsaka. Alphabet reduction for reconfiguration problems. CoRR, abs/2402.10627, 2024. URL: https://arxiv.org/abs/2402.10627.
  26. Naoto Ohsaka. Gap amplification for reconfiguration problems. In SODA, pages 1345-1366, 2024. Google Scholar
  27. Naoto Ohsaka and Tatsuya Matsuoka. Reconfiguration problems on submodular functions. In WSDM, pages 764-774, 2022. Google Scholar
  28. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci., 43(3):425-440, 1991. Google Scholar
  29. Jaikumar Radhakrishnan and Madhu Sudan. On Dinur’s proof of the PCP theorem. Bull. Am. Math. Soc., 44(1):19-61, 2007. Google Scholar
  30. Ran Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998. Google Scholar
  31. Jan van den Heuvel. The complexity of change. In Surveys in Combinatorics 2013, volume 409, pages 127-160. Cambridge University Press, 2013. Google Scholar
  32. Alexander S. Wein. Optimal low-degree hardness of maximum independent set. Math. Stat. Learn., 4(3/4):221-251, 2021. Google Scholar