Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems (2401.00474v1)

Published 31 Dec 2023 in cs.CC, cs.DM, and cs.DS

Abstract: Motivated by the inapproximability of reconfiguration problems, we present a new PCP-type characterization of PSPACE, which we call a probabilistically checkable reconfiguration proof (PCRP): Any PSPACE computation can be encoded into an exponentially long sequence of polynomially long proofs such that every adjacent pair of the proofs differs in at most one bit, and every proof can be probabilistically checked by reading a constant number of bits. Using the new characterization, we prove PSPACE-completeness of approximate versions of many reconfiguration problems, such as the Maxmin $3$-SAT Reconfiguration problem. This resolves the open problem posed by Ito, Demaine, Harvey, Papadimitriou, Sideri, Uehara, and Uno (ISAAC 2008; Theor. Comput. Sci. 2011) as well as the Reconfiguration Inapproximability Hypothesis by Ohsaka (STACS 2023) affirmatively. We also present PSPACE-completeness of approximating the Maxmin Clique Reconfiguration problem to within a factor of $n\epsilon$ for some constant $\epsilon > 0$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (50)
  1. “Computational Complexity: A Modern Approach” Cambridge University Press, 2009
  2. Dimitris Achlioptas, Paul Beame and Michael Molloy “Exponential Bounds for DPLL Below the Satisfiability Threshold” In SODA, 2004, pp. 139–140
  3. “Derandomized graph products” In Comput. Complex. 5, 1995, pp. 60–75
  4. “Proof Verification and the Hardness of Approximation Problems” In J. ACM 45.3, 1998, pp. 501–555
  5. Noga Alon “Explicit Expanders of Every Degree and Size” In Comb. 41.4, 2021, pp. 447–463
  6. “Probabilistic Checking of Proofs: A New Characterization of NP” In J. ACM 45.1, 1998, pp. 70–122
  7. “Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances” In Theor. Comput. Sci. 410.50, 2009, pp. 5215–5226
  8. László Babai, Lance Fortnow and Carsten Lund “Non-Deterministic Exponential Time has Two-Prover Interactive Protocols” In Computational Complexity 1, 1991, pp. 3–40 DOI: 10.1007/BF01200056
  9. “Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding” In SIAM J. Comput. 36.4, 2006, pp. 889–974
  10. “Shortest Reconfiguration of Colorings Under Kempe Changes” In STACS, 2020, pp. 35:1–35:14
  11. “Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs” In FOCS, 2020, pp. 858–869
  12. Paul Bonsma “The Complexity of Rerouting Shortest Paths” In Theor. Comput. Sci. 510, 2013, pp. 1–12
  13. “Randomness-efficient low degree tests and short PCPs via epsilon-biased sets” In STOC, 2003, pp. 612–621
  14. “Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions” In Chic. J. Theor. Comput. Sci. 1995, 1995
  15. “Hardness of Approximation in PSPACE and Separation Results for Pebble Games” In FOCS, 2015, pp. 466–485
  16. Luis Cereceda, Jan van den Heuvel and Matthew Johnson “Finding paths between 3-colorings” In J. Graph Theory 67.1, 2011, pp. 69–82
  17. Irit Dinur “The PCP Theorem by Gap Amplification” In J. ACM 54.3, 2007, pp. 12
  18. Erik D. Demaine and Quanquan C. Liu “Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs” In WADS, 2017, pp. 313–324
  19. “Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem” In SIAM J. Comput. 36.4, 2006, pp. 975–1024
  20. “Analytical approach to parallel repetition” In STOC, 2014, pp. 624–633
  21. Uriel Feige “A Threshold of ln⁡n𝑛\ln nroman_ln italic_n for Approximating Set Cover” In J. ACM 45.4, 1998, pp. 634–652
  22. Uriel Feige, Vahab S. Mirrokni and Jan Vondrák “Maximizing non-monotone submodular functions” In SIAM J. Comput. 40.4, 2011, pp. 1133–1153
  23. “Reconfiguring Shortest Paths in Graphs” In AAAI, 2022, pp. 9758–9766
  24. “The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies” In SIAM J. Comput. 38.6, 2009, pp. 2330–2355
  25. “Locally testable codes and PCPs of almost-linear length” In J. ACM 53.4, 2006, pp. 558–655
  26. “Succinct Representations of Graphs” In Inf. Control. 56.3, 1983, pp. 183–198
  27. Robert A. Hearn and Erik D. Demaine “PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation” In Theor. Comput. Sci. 343.1-2, 2005, pp. 72–96
  28. Robert A. Hearn and Erik D. Demaine “Games, Puzzles, and Computation” A K Peters, Ltd., 2009
  29. Shlomo Hoory, Nathan Linial and Avi Wigderson “Expander graphs and their applications” In Bull. Am. Math. Soc. 43.4, 2006, pp. 439–561
  30. Duc A. Hoang “Combinatorial Reconfiguration”, https://reconf.wikidot.com/, 2023
  31. John E. Hopcroft, Jacob Theodore Schwartz and Micha Sharir “On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE-Hardness of the “Warehouseman’s Problem”” In Int. J. Robot. Res. 3.4, 1984, pp. 76–88
  32. Takehiro Ito and Erik D. Demaine “Approximability of the subset sum reconfiguration problem” In J. Comb. Optim. 28.3, 2014, pp. 639–654
  33. “On the Complexity of Reconfiguration Problems” In Theor. Comput. Sci. 412.12-14, 2011, pp. 1054–1065
  34. “Shortest Reconfiguration of Perfect Matchings via Alternating Cycles” In SIAM J. Discret. Math. 36.2, 2022, pp. 1102–1123
  35. Wm Woolsey Johnson and William Edward Story “Notes on the “15” puzzle” In Am. J. Math. 2.4, 1879, pp. 397–404
  36. Marcin Kamiński, Paul Medvedev and Martin Milanič “Shortest Paths Between Shortest Paths” In Theor. Comput. Sci. 412.39, 2011, pp. 5205–5210
  37. “On the Hardness of Approximating Minimization Problems” In J. ACM 41.5, 1994, pp. 960–981
  38. “Approximation and Hardness of Token Swapping” In ESA, 2016, pp. 66:1–66:15
  39. Sidhanth Mohanty, Ryan O’Donnell and Pedro Paredes “Explicit Near-Ramanujan Graphs of Every Degree” In SIAM J. Comput. 51.3, 2021, pp. STOC20-1-STOC20–23
  40. Naomi Nishimura “Introduction to Reconfiguration” In Algorithms 11.4, 2018, pp. 52
  41. Jakob Nordström “Pebble Games, Proof Complexity, and Time-Space Trade-offs” In Log. Methods Comput. Sci. 9, 2013
  42. Naoto Ohsaka “Gap Amplification for Reconfiguration Problems” In CoRR abs/2310.14160, 2023
  43. Naoto Ohsaka “Gap Preserving Reductions Between Reconfiguration Problems” In STACS, 2023, pp. 49:1–49:18
  44. “Reconfiguration Problems on Submodular Functions” In WSDM, 2022, pp. 764–774
  45. Orr Paradise “Smooth and Strong PCPs” In Comput. Complex. 30.1, 2021, pp. 1
  46. Michael S. Paterson and Carl E. Hewitt “Comparative Schematology” In Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, 1970, pp. 119–127
  47. Christos H. Papadimitriou and Mihalis Yannakakis “A Note on Succinct Representations of Graphs” In Inf. Control. 71.3, 1986, pp. 181–185
  48. Christos H. Papadimitriou and Mihalis Yannakakis “Optimization, Approximation, and Complexity Classes” In J. Comput. Syst. Sci. 43.3, 1991, pp. 425–440
  49. Walter J. Savitch “Relationships between nondeterministic and deterministic tape complexities” In J. Comput. Syst. Sci. 4.2, 1970, pp. 177–192
  50. Jan van den Heuvel “The Complexity of Change” In Surveys in Combinatorics 2013 409 Cambridge University Press, 2013, pp. 127–160
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now