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]
@article{GolovnevIIKKT19,
title = {AC0[p] Lower Bounds against MCSP via the Coin Problem},
author = {Alexander Golovnev and Rahul Ilango and Russell Impagliazzo and Valentine Kabanets and Antonina Kolokolova and Avishay Tal},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/018},
researchr = {https://researchr.org/publication/GolovnevIIKKT19},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {26},
pages = {18},
}