On the complexity of shortest disjunctive normal forms of Boolean functions

DOI10.1090/trans2/135/06zbMath0606.94011OpenAlexW4245154300MaRDI QIDQ3745767

Aleksej Dmitrievich Korshunov

Publication date: 1987

Published in: Six Papers in Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/135/06

zbMATH Keywords

disjunctive normal formformula complexity

Mathematics Subject Classification ID

Boolean functions (06E30) Logical aspects of Boolean algebras (03G05)

Related Items (2)

An upper bound for complexity of polynomial normal forms of Boolean functions ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms

This page was built for publication: On the complexity of shortest disjunctive normal forms of Boolean functions