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类仍是开放问题。