On the composition of randomized query complexity and approximate degree

DOI10.4230/LIPICS.APPROX/RANDOM.2023.63MaRDI QIDQ6663085FDOQ6663085

Swagato Sanyal, Sourav Chakraborty, Manaswi Paraashar, Nitin Saurabh, Rajat Mittal, Chandrima Kayal

Publication date: 14 January 2025

zbMATH Keywords

Boolean functionscomposition theoremapproximate degreepartial functionsrandomized query complexity

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: On the composition of randomized query complexity and approximate degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663085)