Košík

0546261 - MÚ 2022 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Pich, Ján - Santhanamz, R.
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly.
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. New York: ACM, 2021 - (Khuller, S.; Vassilevska Williams, V.), s. 223-233. ISBN 978-1-4503-8053-9.
[53rd Annual ACM SIGACT Symposium on Theory of Computing. Virtual (IT), 21.06.2021-25.06.2021]
Grant CEP: GA ČR(CZ) GA19-05497S
Institucionální podpora: RVO:67985840
Klíčová slova: Cook’s theory
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.1145/3406325.3451117
Trvalý link: http://hdl.handle.net/11104/0322805