Basket

0581950 - MÚ 2024 RIV US eng J - Journal Article
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
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : query complexity * randomized decision tree * composed function * lower bound
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1, year: 2022
Method of publishing: Open access
http://dx.doi.org/10.4086/toc.2021.v017a008
Permanent Link: https://hdl.handle.net/11104/0350086