Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh. The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electronic Colloquium on Computational Complexity (ECCC), 25:157, 2018. [doi]
@article{LimayeSSTV18,
title = {The Coin Problem in Constant Depth: Sample Complexity and Parity gates},
author = {Nutan Limaye and Karteek Sreenivasaiah and Srikanth Srinivasan 0001 and Utkarsh Tripathi and S. Venkitesh},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/157},
researchr = {https://researchr.org/publication/LimayeSSTV18},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {25},
pages = {157},
}