AC0[p] Lower Bounds against MCSP via the Coin Problem

Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal. AC0[p] Lower Bounds against MCSP via the Coin Problem. Electronic Colloquium on Computational Complexity (ECCC), 26:18, 2019. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: