Simple disjunctive normal forms of Boolean functions with a restricted number of zeros

DOI10.1134/S1064562412040102zbMath1257.06007MaRDI QIDQ1761058

Yu. V. Maksimov

Publication date: 15 November 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexitypattern recognitionBoolean functiondisjunctive normal form

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Boolean functions (06E30)

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

• An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations
• Disjunctive normal forms of Boolean functions with a small number of zeros

This page was built for publication: Simple disjunctive normal forms of Boolean functions with a restricted number of zeros