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

DOI10.3103/S0027132213010142zbMATH Open1298.94161MaRDI QIDQ355347FDOQ355347

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• On the depth of \(k\)-valued logic functions over arbitrary bases
• Title not available (Why is that?)
• A logical characterization of constant-depth circuits over the reals
• Title not available (Why is that?)

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)