An improved complexity hierarchy on the depth of Boolean functions

DOI10.1007/BF00288962zbMath0431.94058OpenAlexW2087109905MaRDI QIDQ1138531

Ingo Wegener

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288962

zbMATH Keywords

depthcircuit complexitycomplexity hierarchycomplexity measures for Boolean functionsnondegenerate Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Lattice Theoretic Properties of Frontal Switching Functions

This page was built for publication: An improved complexity hierarchy on the depth of Boolean functions