Search results
- 1.0582267 - MÚ 2025 RIV DE eng C - Conference Paper (international conference)
Folwarczný, Lukáš - Göös, M. - Hubáček, Pavel - Maystre, G. - Yuan, W.
One-way functions vs. TFNP: Simpler and improved.
15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2024 - (Guruswami, V.), č. článku 50. 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
Institutional support: RVO:67985840
Keywords : TFNP * one-way functions * Oracle * Black-Box
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/0350366File Download Size Commentary Version Access Folwarczny.pdf 1 763 KB Publisher’s postprint open-access - 2.0579481 - MÚ 2024 RIV CH eng C - Conference Paper (international conference)
Dvořák, P. - Folwarczný, Lukáš - Opler, M. - Pudlák, Pavel - Šámal, R. - Vu, T.
Bounds on functionality and symmetric difference - two intriguing graph parameters.
Graph-Theoretic Concepts in Computer Science. Cham: Springer, 2023 - (Paulusma, D.; Ries, B.), s. 305-318. Lecture Notes in Computer Science, 14093. ISBN 978-3-031-43379-5. ISSN 0302-9743.
[49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. Fribourg (CH), 28.06.2023-30.06.2023]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : finite projective plane * functionality * intersection graphs * symmetric difference
OECD category: Pure mathematics
https://doi.org/10.1007/978-3-031-43380-1_22
Permanent Link: https://hdl.handle.net/11104/0348321File Download Size Commentary Version Access Folwarczny3.pdf 0 247.8 KB Publisher’s postprint require - 3.0569857 - MÚ 2024 RIV DE eng C - Conference Paper (international conference)
Bourneuf, R. - Folwarczný, Lukáš - Hubáček, P. - Rosen, A. - Schwartzbach, N. I.
PPP-completeness and extremal combinatorics.
14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2023 - (Kalai, Y.), č. článku 22. Leibniz International Proceedings in Informatics, 251. ISBN 978-3-95977-263-1. ISSN 1868-8969.
[14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Cambridge, Massachusetts (US), 10.01.2023-13.01.2023]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : total search problems * extremal combinatorics * PPP-completeness
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.4230/LIPIcs.ITCS.2023.22
Permanent Link: https://hdl.handle.net/11104/0341197File Download Size Commentary Version Access Folwarczny.pdf 0 778.8 KB Publisher’s postprint open-access