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]
@inproceedings{Ben-DavidB20,
title = {A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract},
author = {Shalev Ben-David and Eric Blais},
year = {2020},
doi = {10.1109/FOCS46700.2020.00031},
url = {https://doi.org/10.1109/FOCS46700.2020.00031},
researchr = {https://researchr.org/publication/Ben-DavidB20},
cites = {0},
citedby = {0},
pages = {240-246},
booktitle = {61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020},
publisher = {IEEE},
isbn = {978-1-7281-9621-3},
}