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

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]

This author has not been identified. Look up 'Nutan Limaye' in GoogleThis author has not been identified. Look up 'Karteek Sreenivasaiah' in GoogleThis author has not been identified. Look up 'Srikanth Srinivasan 0001' in GoogleThis author has not been identified. Look up 'Utkarsh Tripathi' in GoogleThis author has not been identified. Look up 'S. Venkitesh' in Google

runs on WebDSL