On the composition of randomized query complexity and approximate degree

DOI10.4230/LIPICS.APPROX/RANDOM.2023.63MaRDI QIDQ6663085zbMATH OpenFDO

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

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.63

zbMATH Keywords

approximate degreeBoolean functionscomposition theorempartial functionsrandomized query complexity

Mathematics Subject Classification ID

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

Cited in

(6)

• Quantum speedups for linear programming via interior point methods
• Randomized query composition and sabotage complexity
• Randomized query composition and product distributions
• Approximate degree composition for recursive functions
• Quantum sabotage complexity
• Lifting to randomized parity decision trees

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)