Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits

DOI10.1134/S1064230706030142zbMath1260.94091OpenAlexW2011543797MaRDI QIDQ1946416

I. F. Cheburakhin

Publication date: 12 April 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230706030142

Mathematics Subject Classification ID

Synthesis problems (93B50)

Cites Work

• Methods for decomposition of Boolean functions: algorithms, quality indices, and applications
• On the comparison of Boolean bases
• On an infinite sequence of improving Boolean bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits