Shortest and minimal disjunctive normal forms of complete functions

DOI10.1134/S0965542515070106zbMath1341.68064OpenAlexW985418761MaRDI QIDQ500624

Yu. V. Maksimov

Publication date: 5 October 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functiondisjunctive normal formcomplexity of implementing Boolean functions by disjunctive normal forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The DNF exception problem
• Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms
• Simple disjunctive normal forms of Boolean functions with a restricted number of zeros
• Comparative analysis of the complexity of Boolean functions with a small number of zeros
• On algorithm complexity
• An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations
• Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms

This page was built for publication: Shortest and minimal disjunctive normal forms of complete functions