Depth of Boolean functions realized by circuits over an arbitrary infinite basis

DOI10.3103/S0027132213010142MaRDI QIDQ355347zbMATH OpenFDO

Authors O. M. Kasim-Zade

Publication date 24 July 2013

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites work

• scientific article; zbMATH DE number 5373691 (Why is no real title available?)
• scientific article; zbMATH DE number 3607492 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• On the depth of Boolean functions over an arbitrary infinite basis

Cited in

(4)

• scientific article; zbMATH DE number 5373691 (Why is no real title available?)
• scientific article; zbMATH DE number 1747443 (Why is no real title available?)
• On the depth of \(k\)-valued logic functions over arbitrary bases
• A logical characterization of constant-depth circuits over the reals

This page was built for publication: Depth of Boolean functions realized by circuits over an arbitrary infinite basis

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