An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations

DOI10.1016/0041-5553(86)90095-9zbMath0627.94025OpenAlexW2150883061MaRDI QIDQ3764059

Yu. I. Zhuravlev, Alexander Kogan

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0041-5553(86)90095-9

zbMATH Keywords

approximation algorithm

Mathematics Subject Classification ID

Classical propositional logic (03B05) Boolean functions (06E30)

Related Items (4)

Shortest and minimal disjunctive normal forms of complete functions ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms ⋮ Simple disjunctive normal forms of Boolean functions with a restricted number of zeros ⋮ Binary functions of multivalued arguments: generalization and investigation of disjunctive normal forms for such functions

This page was built for publication: An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations