Comparative analysis of the complexity of Boolean functions with a small number of zeros
From MaRDI portal
Publication:1945211
DOI10.1134/S1064562412060051zbMath1284.06031MaRDI QIDQ1945211
Publication date: 3 April 2013
Published in: Doklady Mathematics (Search for Journal in Brave)
Related Items (2)
Shortest and minimal disjunctive normal forms of complete functions ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
Cites Work
This page was built for publication: Comparative analysis of the complexity of Boolean functions with a small number of zeros
