"A Composition Theorem for Randomized Query Complexity."

Anurag Anshu et al. (2017)

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2017.10

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics