Skip to content

Bounds on the QAC0 Complexity of Approximating Parity

Video by Simons Institute for the Theory of Computing, played through YouTube's embedded player.

Part of ITCS 2021 (pre-recorded talks)