The Coin Problem in Constant Depth: Sample Complexity and Parity gates

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]

Authors

Nutan Limaye

This author has not been identified. Look up 'Nutan Limaye' in Google

Karteek Sreenivasaiah

This author has not been identified. Look up 'Karteek Sreenivasaiah' in Google

Srikanth Srinivasan 0001

This author has not been identified. Look up 'Srikanth Srinivasan 0001' in Google

Utkarsh Tripathi

This author has not been identified. Look up 'Utkarsh Tripathi' in Google

S. Venkitesh

This author has not been identified. Look up 'S. Venkitesh' in Google