Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
From MaRDI portal
Publication:5415496
DOI10.1145/2213977.2214023zbMath1286.94108OpenAlexW2162446681MaRDI QIDQ5415496
Michal Koucký, Pavel Pudlák, Emanuele Viola, Anna Gál, Kristoffer Arnsfelt Hansen
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214023
Related Items