License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2022.33
URN: urn:nbn:de:0030-drops-165954
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16595/
Göös, Mika ;
Hollender, Alexandros ;
Jain, Siddhartha ;
Maystre, Gilbert ;
Pires, William ;
Robere, Robert ;
Tao, Ran
Further Collapses in TFNP
Abstract
We show EOPL = PLS ∩ PPAD. Here the class EOPL consists of all total search problems that reduce to the End-of-Potential-Line problem, which was introduced in the works by Hubáček and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 2020). In particular, our result yields a new simpler proof of the breakthrough collapse CLS = PLS ∩ PPAD by Fearnley et al. (STOC 2021). We also prove a companion result SOPL = PLS ∩ PPADS, where SOPL is the class associated with the Sink-of-Potential-Line problem.
BibTeX - Entry
@InProceedings{goos_et_al:LIPIcs.CCC.2022.33,
author = {G\"{o}\"{o}s, Mika and Hollender, Alexandros and Jain, Siddhartha and Maystre, Gilbert and Pires, William and Robere, Robert and Tao, Ran},
title = {{Further Collapses in TFNP}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16595},
URN = {urn:nbn:de:0030-drops-165954},
doi = {10.4230/LIPIcs.CCC.2022.33},
annote = {Keywords: TFNP, PPAD, PLS, EOPL}
}
|
Keywords: |
|
TFNP, PPAD, PLS, EOPL |
|
Collection: |
|
37th Computational Complexity Conference (CCC 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
11.07.2022 |
