On a hierarchy of Boolean functions hard to compute in constant depth

zbMATH Open0968.68054MaRDI QIDQ2718887

Anna Bernasconi

Publication date: 13 May 2001

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121218

zbMATH Keywords

Boolean functionsgeneral models of computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits

This page was built for publication: On a hierarchy of Boolean functions hard to compute in constant depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2718887)