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.

翻译：最近，Pasarkar、Papadimitriou和Yannakakis（ITCS 2023）引入了新的TFNP子类PLC，该子类包含PPP类；他们还证明了若干与极值组合原理（例如拉姆齐定理和向日葵引理）相关的搜索问题属于PLC。本文通过简短证明指出，PLC类同样包含PLS——一个可通过局部搜索方法求解的TFNP问题复杂度类。然而，PLC是否包含PPA类的问题仍未解决。