A study on monotone self-dual Boolean functions

Mustafa Altun; Marc D. Riedel

doi:10.1007/s10255-017-0633-x

A study on monotone self-dual Boolean functions

Mustafa Altun^*, Marc D. Riedel

^*Corresponding author for this work

Department of Electronics and Communication Engineering

University of Minnesota Twin Cities

Research output: Contribution to journal › Article › peer-review

Abstract

This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n³).

Original language	English
Pages (from-to)	43-52
Number of pages	10
Journal	Acta Mathematicae Applicatae Sinica
Volume	33
Issue number	1
DOIs	https://doi.org/10.1007/s10255-017-0633-x
Publication status	Published - 1 Feb 2017

Bibliographical note

Publisher Copyright:
© 2017, Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg.

Keywords

duality problem
monotone Boolean functions
self-dual Boolean functions

Access to Document

10.1007/s10255-017-0633-x

Cite this

@article{0df6c5e5938a4cbcb6e3f24f3bbf89f9,

title = "A study on monotone self-dual Boolean functions",

abstract = "This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n3).",

keywords = "duality problem, monotone Boolean functions, self-dual Boolean functions",

author = "Mustafa Altun and Riedel, {Marc D.}",

note = "Publisher Copyright: {\textcopyright} 2017, Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg.",

year = "2017",

month = feb,

day = "1",

doi = "10.1007/s10255-017-0633-x",

language = "English",

volume = "33",

pages = "43--52",

journal = "Acta Mathematicae Applicatae Sinica",

issn = "0168-9673",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - A study on monotone self-dual Boolean functions

AU - Altun, Mustafa

AU - Riedel, Marc D.

PY - 2017/2/1

Y1 - 2017/2/1

N2 - This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n3).

AB - This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n3).

KW - duality problem

KW - monotone Boolean functions

KW - self-dual Boolean functions

UR - http://www.scopus.com/inward/record.url?scp=85015637527&partnerID=8YFLogxK

U2 - 10.1007/s10255-017-0633-x

DO - 10.1007/s10255-017-0633-x

M3 - Article

AN - SCOPUS:85015637527

SN - 0168-9673

VL - 33

SP - 43

EP - 52

JO - Acta Mathematicae Applicatae Sinica

JF - Acta Mathematicae Applicatae Sinica

IS - 1

ER -

A study on monotone self-dual Boolean functions

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this