On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits

DOI10.1134/S1064230713030064zbMath1323.94184OpenAlexW2066362579MaRDI QIDQ2263837

E. K. Egorova, I. F. Cheburakhin

Publication date: 19 March 2015

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Mathematical models for intellectualization of synthesis of discrete logical control units
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits