Lower bounds for depth-three circuits with equals and mod-gates

DOI10.1007/3-540-59042-0_63zbMath1379.68152OpenAlexW2148134970MaRDI QIDQ4596611

Frederic Green

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_63

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

A note on a theorem of Barrington, Straubing and Thérien

This page was built for publication: Lower bounds for depth-three circuits with equals and mod-gates