On the comparison of Boolean bases
From MaRDI portal
Publication:1594495
Recommendations
Cited in
(21)- On almost bad Boolean bases
- On the premaximal Boolean bases
- scientific article; zbMATH DE number 3993452 (Why is no real title available?)
- On the construction of parallel computers from various basis of Boolean functions
- scientific article; zbMATH DE number 3970686 (Why is no real title available?)
- The complexity hierarchy of Boolean bases
- Permutation and phase independent Boolean comparison
- scientific article; zbMATH DE number 4049556 (Why is no real title available?)
- scientific article; zbMATH DE number 4072877 (Why is no real title available?)
- scientific article; zbMATH DE number 4104874 (Why is no real title available?)
- Complexity of implementation of Boolean functions by real-valued formulas
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
- On a class of bases for Boolean functions
- On the complexity of realization of the linear function by formulas over finite Boolean bases
- scientific article; zbMATH DE number 4142098 (Why is no real title available?)
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
- Comparison of Boolean algebras
- Boole vs Wadge: comparing two basic tools of descriptive set theory
- On the complexity of joint realization of Boolean functions regular systems in the DNF basis
- On an infinite sequence of improving Boolean bases
- scientific article; zbMATH DE number 4031581 (Why is no real title available?)
This page was built for publication: On the comparison of Boolean bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594495)
