"A Composition Theorem for Randomized Query Complexity via Max-Conflict ..."

Dmitry Gavinsky et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics