0582265 - MÚ 2025 RIV DE eng C - Conference Paper (international conference)
Hubáček, Pavel - Khaniki, Erfan - Thapen, NeilTFNP intersections through the lens of feasible disjunction.
15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2024 - (Guruswami, V.), č. článku 63. Leibniz International Proceedings in Informatics (LIPIcs), 287. ISBN 978-3-95977-309-6.
[15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Berkeley (US), 30.01.2024-02.02.2024]
R&D Projects: GA ČR(CZ) GX19-27871X; GA ČR(CZ) GA23-04825S
Institutional support: RVO:67985840
Keywords : TFNP * feasible disjunction * proof complexity * TFNP intersection classes
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: https://hdl.handle.net/11104/0350365
