scientific article; zbMATH DE number 4097290
From MaRDI portal
Publication:3824348
Recommendations
Cited in
(20)- The implementation of certain classes of Boolean functions in iterative networks
- On complexity of schemes in incomplete bases
- On the complexity of schemes in an infinite basis
- On complexity of schemes in degenerate bases
- A class of functions from P₂
- Periodic Boolean functions and a lower bound for the complexity of operators
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- Asymptotics for the complexity of Boolean functions with small number of ones
- Complexity of realization of underdetermined Boolean functions
- On a metric characteristic of implicit and parametric representations of Boolean functions
- scientific article; zbMATH DE number 3896833 (Why is no real title available?)
- scientific article; zbMATH DE number 3957104 (Why is no real title available?)
- scientific article; zbMATH DE number 4047105 (Why is no real title available?)
- scientific article; zbMATH DE number 3788540 (Why is no real title available?)
- scientific article; zbMATH DE number 139638 (Why is no real title available?)
- scientific article; zbMATH DE number 139643 (Why is no real title available?)
- scientific article; zbMATH DE number 139645 (Why is no real title available?)
- scientific article; zbMATH DE number 647645 (Why is no real title available?)
- Complexity of the realization of a linear Boolean function in the class of -schemes
- scientific article; zbMATH DE number 850402 (Why is no real title available?)
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 Q3824348)
