2000 character limit reached
Corrigendum: PLS is contained in PLC
Published 7 Dec 2023 in cs.CC | (2312.04051v2)
Abstract: Recently, Pasarkar, Papadimitriou, and Yannakakis (ITCS 2023) have introduced the new TFNP subclass called PLC that contains the class PPP; they also have proven that several search problems related to extremal combinatorial principles (e.g., Ramsey's theorem and the Sunflower lemma) belong to PLC. This short paper shows that the class PLC also contains PLS, a complexity class for TFNP problems that can be solved by a local search method. However, it is still open whether PLC contains the class PPA.
- Joshua Buresh-Oppenheim “On the TFNP complexity of factoring”, 2006 URL: https://www.cs.toronto.edu/~bureshop/factor.pdf
- Xi Chen, Xiaotie Deng and Shang-Hua Teng “Settling the complexity of computing two-player Nash equilibria” In J. ACM 56.3, 2009, pp. 14:1–14:57 DOI: 10.1145/1516512.1516516
- Argyrios Deligkas, John Fearnley and Themistoklis Melissourgos “Pizza Sharing Is PPA-Hard” In Thirty-Sixth AAAI Conference on Artificial Intelligence AAAI Press, 2022, pp. 4957–4965 DOI: 10.1609/AAAI.V36I5.20426
- Constantinos Daskalakis, Paul W. Goldberg and Christos H. Papadimitriou “The complexity of computing a Nash equilibrium” In Commun. ACM 52.2, 2009, pp. 89–97 DOI: 10.1145/1461928.1461951
- Constantinos Daskalakis and Christos H. Papadimitriou “Continuous Local Search” In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SIAM, 2011, pp. 790–804 DOI: 10.1137/1.9781611973082.62
- “Unique end of potential line” In Journal of Computer and System Sciences 114, 2020, pp. 1–35 DOI: 10.1016/J.JCSS.2020.05.007
- Aris Filos-Ratsikas and Paul W. Goldberg “Consensus halving is PPA-complete” In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing ACM, 2018, pp. 51–64 DOI: 10.1145/3188745.3188880
- Paul W. Goldberg, Kasper Høgh and Alexandros Hollender “The Frontier of Intractability for EFX with Two Agents” In Algorithmic Game Theory - 16th International Symposium 14238, Lecture Notes in Computer Science Springer, 2023, pp. 290–307 DOI: 10.1007/978-3-031-43254-5\_17
- “On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem” In 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference) 169, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, pp. 19:1–19:42 DOI: 10.4230/LIPICS.CCC.2020.19
- “Further Collapses in TFNP” In 37th Computational Complexity Conference 234, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, pp. 33:1–33:15 DOI: 10.4230/LIPICS.CCC.2022.33
- Paul W. Goldberg and Christos H. Papadimitriou “Towards a unified complexity theory of total functions” In Journal of Computer and System Sciences 94, 2018, pp. 167–192 DOI: 10.1016/J.JCSS.2017.12.003
- Alexandros Hollender and Paul W. Goldberg “The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard” In Electron. Colloquium Comput. Complex. TR18-120, 2018 ECCC: https://eccc.weizmann.ac.il/report/2018/120
- “On Search Complexity of Discrete Logarithm” In 46th International Symposium on Mathematical Foundations of Computer Science 202, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, pp. 60:1–60:16 DOI: 10.4230/LIPICS.MFCS.2021.60
- Takashi Ishizuka “The complexity of the parity argument with potential” In Journal of Computer and System Sciences 120, 2021, pp. 14–41 DOI: 10.1016/J.JCSS.2021.03.004
- Emil Jerábek “Integer factoring and modular square roots” In Journal of Computer and System Sciences 82.2, 2016, pp. 380–394 DOI: 10.1016/J.JCSS.2015.08.001
- David S. Johnson, Christos H. Papadimitriou and Mihalis Yannakakis “How Easy is Local Search?” In Journal of Computer and System Sciences 37.1, 1988, pp. 79–100 DOI: 10.1016/0022-0000(88)90046-3
- Nimrod Megiddo and Christos H. Papadimitriou “On Total Functions, Existence Theorems and Computational Complexity” In Theoretical Computer Science 81.2, 1991, pp. 317–324 DOI: 10.1016/0304-3975(91)90200-L
- Christos H. Papadimitriou “On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence” In Journal of Computer and System Sciences 48.3, 1994, pp. 498–532 DOI: 10.1016/S0022-0000(05)80063-7
- Amol Pasarkar, Christos H. Papadimitriou and Mihalis Yannakakis “Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP” In 14th Innovations in Theoretical Computer Science Conference 251, LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 88:1–88:20 DOI: 10.4230/LIPICS.ITCS.2023.88
- Pavel Pudlák “On the complexity of finding falsifying assignments for Herbrand disjunctions” In Arch. Math. Log. 54.7-8, 2015, pp. 769–783 DOI: 10.1007/s00153-015-0439-6
- Katerina Sotiraki, Manolis Zampetakis and Giorgos Zirdelis “PPP-Completeness with Connections to Cryptography” In 59th IEEE Annual Symposium on Foundations of Computer Science IEEE Computer Society, 2018, pp. 148–158 DOI: 10.1109/FOCS.2018.00023
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.