Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

Sophie Laplante, Frédéric Magniez. Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. SIAM Journal on Computing, 38(1):46-62, 2008. [doi]

No reviews for this publication, yet.