scientific article; zbMATH DE number 3619806

MaRDI QIDQ4182434zbMATH OpenFDO

Authors William F. McColl

Publication date 1976

zbMATH Keywords

Depth of Boolean Functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• The circuit depth of symmetric Boolean functions
• Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
• On the depth complexity of the counting functions

This page was built for publication:

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