Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial Boolean functions

DOI10.1007/BF01157923MaRDI QIDQ1148870zbMATH OpenFDO

Authors Alexander Sapozhenko

Publication date 1981

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

irredundant disjunctive normal form

Mathematics Subject Classification ID

Cites work

• The Production of Completion Signals by Asynchronous, Iterative Networks

Cited in

(1)

• On the complexity of the dualization problem

This page was built for publication: Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148870)