Iteration of Boolean (n,n)-operators

MaRDI QIDQ2377650zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 20 January 2009

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Recommendations

• Periodic Boolean functions and a lower bound for the complexity of operators
• On the complexity of realizing the powers of a Boolean (n,n)-function
• The orbit of closure-involution operations: the case of Boolean functions
• Average time of computing Boolean operators
• The implementation of certain classes of Boolean functions in iterative networks

Cited in

(5)

• Iterative characterizations of Boolean algebras
• Cycles generated by sequential iterations
• scientific article; zbMATH DE number 3869229 (Why is no real title available?)
• scientific article; zbMATH DE number 3922733 (Why is no real title available?)
• scientific article; zbMATH DE number 1759421 (Why is no real title available?)

This page was built for publication: Iteration of Boolean \((n,n)\)-operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377650)