Weighted Gate Elimination

DOI10.1145/2840728.2840755zbMath1334.94109OpenAlexW2293286499MaRDI QIDQ2800589

Alexander Golovnev, Alexander S. Kulikov

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840755

zbMATH Keywords

lower boundsBoolean circuitsdispersers

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On the limits of gate elimination ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Improved Extractors for Recognizable and Algebraic Sources

This page was built for publication: Weighted Gate Elimination