Corrigendum: PLS is contained in PLC
Computational Complexity
2024-02-14 v2
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.
Cite
@article{arxiv.2312.04051,
title = {Corrigendum: PLS is contained in PLC},
author = {Takashi Ishizuka},
journal= {arXiv preprint arXiv:2312.04051},
year = {2024}
}
Comments
There is a significant error in the proof of Lemma 14