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]

Authors

Alexander Golovnev

This author has not been identified. Look up 'Alexander Golovnev' in Google

Rahul Ilango

This author has not been identified. Look up 'Rahul Ilango' in Google

Russell Impagliazzo

This author has not been identified. Look up 'Russell Impagliazzo' in Google

Valentine Kabanets

This author has not been identified. Look up 'Valentine Kabanets' in Google

Antonina Kolokolova

This author has not been identified. Look up 'Antonina Kolokolova' in Google

Avishay Tal

This author has not been identified. Look up 'Avishay Tal' in Google