On the depth of Boolean functions over an arbitrary infinite basis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5373691
- Depth of functions of the \(k\)-valued logic in infinite bases
- Depth of functions of \(k\)-valued logic in finite bases
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- On the depth of \(k\)-valued logic functions over arbitrary bases
Cited in
(19)- An improved complexity hierarchy on the depth of Boolean functions
- On the depth of the storage access function
- On the depth of \(k\)-valued logic functions over arbitrary bases
- Multilevel representation and complexity of circuits of unbounded fan-in gates
- Depth of schemes embedded in a unit cube and implementing typical Boolean functions
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- On Depth and \(\text{Depth}^{+}\) of Boolean algebras
- Depth of -completions of systems of Boolean functions.
- Depth of functions of the \(k\)-valued logic in infinite bases
- On function depth of logic algebra in arbitrary complete basis
- scientific article; zbMATH DE number 5373691 (Why is no real title available?)
- Depth of Boolean functions realized by circuits over an arbitrary infinite basis
- Depth of functions of \(k\)-valued logic in finite bases
- scientific article; zbMATH DE number 4085724 (Why is no real title available?)
- New inequality relations between depth and delay
- On circuits of functional elements of finite depth of branching
- On the Delay Required to Realize Boolean Functions
- scientific article; zbMATH DE number 2237377 (Why is no real title available?)
- On a class of bases for Boolean functions
This page was built for publication: On the depth of Boolean functions over an arbitrary infinite basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115629)
