On complexity of schemes in degenerate bases
From MaRDI portal
(Redirected from On complexity of schemes in degenerate bases)
The author discusses problems on the realization of Boolean functions from closed Post classes [\textit{S. V. Yablonskij, G. P. Gavrilov} and \textit{V. B. Kudryavtsev}, Functions of Boolean algebra and Post classes, Nauka, Moscow (1966; Zbl 0171.27701)] by schemes of functional elements in incomplete bases containing the zero weight elements. Shannon functions are described for some closed classes.
Recommendations
Cited in
(12)- On complexity of schemes in incomplete bases
- On the complexity of schemes in an infinite basis
- On recognition of some properties of systems of finite-valued functions
- On a basis for schemes consisting of cellular elements
- scientific article; zbMATH DE number 3871200 (Why is no real title available?)
- scientific article; zbMATH DE number 5077418 (Why is no real title available?)
- scientific article; zbMATH DE number 3896833 (Why is no real title available?)
- scientific article; zbMATH DE number 3970686 (Why is no real title available?)
- scientific article; zbMATH DE number 3970687 (Why is no real title available?)
- scientific article; zbMATH DE number 4097289 (Why is no real title available?)
- scientific article; zbMATH DE number 4097290 (Why is no real title available?)
- scientific article; zbMATH DE number 3319974 (Why is no real title available?)
This page was built for publication: On complexity of schemes in degenerate bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406445)
