The complexity of Boolean function implementation in some classes of automaton circuits

MaRDI QIDQ5947815zbMATH OpenFDO

Authors A. A. Nikitin

Publication date 28 October 2001

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

zbMATH Keywords

automaton circuitsBoolean functionscomplexitynetworks

Mathematics Subject Classification ID

Boolean functions (06E30) Theory of computing (68Q99)

Recommendations

• scientific article; zbMATH DE number 2032375
• scientific article; zbMATH DE number 15477
• scientific article; zbMATH DE number 850402
• On the complexity of realization of partial Boolean functions by circuits of functional elements
• scientific article; zbMATH DE number 4187721
• On complexity of a particular Boolean functions class
• scientific article; zbMATH DE number 4170848
• Complexity of implementation of Boolean functions by real-valued formulas
• scientific article; zbMATH DE number 850321
• On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits

Cited in

(6)

• The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits
• On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 15477 (Why is no real title available?)
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

This page was built for publication: The complexity of Boolean function implementation in some classes of automaton circuits

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