Dualization of regular Boolean functions

A monotonic Boolean function is regular if its variables are naturally ordered by decreasing ‘strength’, so that shifting to the right the non-zero entries of any binary false point always yields another false point. Peled and Simeone recently published a polynomial algorithm to generate the maximal...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 16; no. 1; pp. 79 - 85
Main Author Crama, Y.
Format Journal Article Web Resource
LanguageEnglish
Published Elsevier B.V 1987
Elsevier Science
Subjects
Mathematics
Mathématiques
Physical, chemical, mathematical & earth Sciences
Physique, chimie, mathématiques & sciences de la terre
Online AccessGet full text

Cover

More Information
Summary:A monotonic Boolean function is regular if its variables are naturally ordered by decreasing ‘strength’, so that shifting to the right the non-zero entries of any binary false point always yields another false point. Peled and Simeone recently published a polynomial algorithm to generate the maximal false points (MFP's) of a regular function from a list of its minimal true points (MTP's). Another efficient algorithm for this problem is presented here, based on characterization of the MFP's of a regular function in terms of its MTP's. This result is also used to derive a new upper bound on the number of MFP's of a regular function.
Bibliography:scopus-id:2-s2.0-0023111480
ISSN:0166-218X
1872-6771
1872-6771
DOI:10.1016/0166-218X(87)90056-4