On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits

MaRDI QIDQ1847355zbMATH OpenFDO

Authors Yanyan Li

Publication date 25 November 2002

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

zbMATH Keywords

conveyor circuititerative control systems with memory

Mathematics Subject Classification ID

Recommendations

• The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits
• On implementation of Boolean functions by contact circuits of minimal uniform width
• The minimal circuits for linear Boolean functions
• On implementation of Boolean functions by contact circuits with a constant uniform width
• scientific article; zbMATH DE number 4170848
• Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits
• scientific article; zbMATH DE number 3878851
• On the complexity and depth of circuits that realize partial Boolean functions
• Minimal contact circuits for a sequence of Boolean functions

Cited in

(1)

• The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits

This page was built for publication: On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits

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