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

DOI10.1007/BF01157923zbMATH Open0452.94034MaRDI QIDQ1148870FDOQ1148870

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)