scientific article; zbMATH DE number 139638
From MaRDI portal
Publication:4029618
[For the entire collection see Zbl 0745.00057.] Let \(f\) be a Boolean function, \(C\) a class of elements such that \(f\) can be realized in \(C\), \(L_ C(f)\) the complexity of \(f\) in \(C\). The author gives some relation between \(L_ K(f)\) and \(L_ F(f)\) where \(K\) is the class of contact schemes and \(F\) is the class of schemes with functional elements.
Recommendations
Cited in
(13)- Depth of -completions of systems of Boolean functions.
- Complexity and structure of near-minimal contact circuits for elementary symmetric functions
- scientific article; zbMATH DE number 4176991 (Why is no real title available?)
- scientific article; zbMATH DE number 5373691 (Why is no real title available?)
- scientific article; zbMATH DE number 4095387 (Why is no real title available?)
- scientific article; zbMATH DE number 4097290 (Why is no real title available?)
- scientific article; zbMATH DE number 23021 (Why is no real title available?)
- A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
- On a model of plane contact schemes
- scientific article; zbMATH DE number 957589 (Why is no real title available?)
- scientific article; zbMATH DE number 4187719 (Why is no real title available?)
- scientific article; zbMATH DE number 4189653 (Why is no real title available?)
- On the complexity of realizations of Boolean functions in some classes of hypercontact circuits
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 Q4029618)
