A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract

Shalev Ben-David, Eric Blais. A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. pages 240-246, IEEE, 2020. [doi]

Authors

Shalev Ben-David

This author has not been identified. Look up 'Shalev Ben-David' in Google

Eric Blais

This author has not been identified. Look up 'Eric Blais' in Google