A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

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]

Abstract is missing.

runs on WebDSL