Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh. A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM Journal on Computing, 50(4):1461-1499, 2021. [doi]
@article{LimayeSSTV21,
title = {A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem},
author = {Nutan Limaye and Karteek Sreenivasaiah and Srikanth Srinivasan 0001 and Utkarsh Tripathi and S. Venkitesh},
year = {2021},
doi = {10.1137/19M1276467},
url = {https://doi.org/10.1137/19M1276467},
researchr = {https://researchr.org/publication/LimayeSSTV21},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {50},
number = {4},
pages = {1461-1499},
}