AC0[p] Lower Bounds against MCSP via the Coin ProblemMarkAlexander Golovnev[0]Rahul IlangoRussell Impagliazzo[0]Valentine Kabanets[0]Antonina Kolokolova[0]Avishay Tal[0]Electronic Colloquium on Computational Complexity (ECCC), pp. 182019.Cited by: 0|Bibtex|Views51|LinksEI Code: Data: Full Text (Upload PDF)PPT (Upload PPT)Upload PDFUpload PPTYour rating :0 TagsCommentsSubmit
