Vytisknout
0581950 - MÚ 2024 RIV US eng J - Článek v odborném periodiku
Gavinsky, Dmitry - Lee, T. - Santha, M. - Sanyal, S.
Optimal composition theorem for randomized query complexity.
Theory of Computing. Roč. 19, December (2023), č. článku 9. ISSN 1557-2862. E-ISSN 1557-2862
Grant CEP: GA ČR(CZ) GX19-27871X
Institucionální podpora: RVO:67985840
Klíčová slova: query complexity * randomized decision tree * composed function * lower bound
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 1, rok: 2022
Způsob publikování: Open access
http://dx.doi.org/10.4086/toc.2021.v017a008
Trvalý link: https://hdl.handle.net/11104/0350086
Gavinsky, Dmitry - Lee, T. - Santha, M. - Sanyal, S.
Optimal composition theorem for randomized query complexity.
Theory of Computing. Roč. 19, December (2023), č. článku 9. ISSN 1557-2862. E-ISSN 1557-2862
Grant CEP: GA ČR(CZ) GX19-27871X
Institucionální podpora: RVO:67985840
Klíčová slova: query complexity * randomized decision tree * composed function * lower bound
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 1, rok: 2022
Způsob publikování: Open access
http://dx.doi.org/10.4086/toc.2021.v017a008
Trvalý link: https://hdl.handle.net/11104/0350086