On the Limits of Gate Elimination

DOI10.4230/LIPIcs.MFCS.2016.46zbMath1393.68060OpenAlexW2552860866MaRDI QIDQ4608608

Edward A. Hirsch, Alexander Knop, Alexander Golovnev, Alexander S. Kulikov

Publication date: 21 March 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6459/pdf/LIPIcs-MFCS-2016-46.pdf/

zbMATH Keywords

lower boundscircuit complexitygate elimination

Mathematics Subject Classification ID

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

Related Items (3)

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

This page was built for publication: On the Limits of Gate Elimination