Bounded-depth circuits

DOI10.1145/1060590.1060629zbMath1192.68298OpenAlexW2037281399MaRDI QIDQ3581426

Michal Koucký, Denis Thérien, Pavel Pudlák

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

The complexity of intersecting finite automata having few final states ⋮ A Circuit Complexity Approach to Transductions ⋮ Circuit complexity of regular languages

This page was built for publication: Bounded-depth circuits