Sophie Laplante, Frédéric Magniez. Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 294-304, IEEE Computer Society, 2004. [doi]
Abstract is missing.