On the Hardness against Constant-Depth Linear-Size Circuits
From MaRDI portal
Publication:3578298
DOI10.1007/978-3-642-14031-0_4zbMath1286.68203OpenAlexW1998415931MaRDI QIDQ3578298
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_4
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (1)
This page was built for publication: On the Hardness against Constant-Depth Linear-Size Circuits