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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.