𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interior and exterior functions of positive Boolean functions

✍ Scribed by Kazuhisa Makino; Hirotaka Ono; Toshihide Ibaraki


Book ID
104294156
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
237 KB
Volume
130
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis


The interior and exterior functions of a Boolean function f were introduced in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209-231), as stability (or robustness) measures of the f. In this paper, we investigate the complexity of two problems -INTERIOR and -EXTERIOR, introduced therein. We ΓΏrst answer the question about the complexity of -INTERIOR left open in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) ; it has no polynomial total time algorithm even if is bounded by a constant, unless P = NP. However, for positive h-term DNF functions with h bounded by a constant, problems -INTERIOR and -EXTERIOR can be solved in (input) polynomial time and polynomial delay, respectively. Furthermore, for positive k-DNF functions, -INTERIOR for two cases in which k = 1, and and k are both bounded by a constant, can be solved in polynomial delay and in polynomial time, respectively.


πŸ“œ SIMILAR VOLUMES


Graph Functions of Boolean Functions
✍ Reischer, Corina; Simovici, Dan A. πŸ“‚ Article πŸ“… 1984 πŸ› IEEE 🌐 English βš– 511 KB
Cryptographic Boolean Functions and Appl
✍ Cusick, Thomas W. πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier 🌐 English βš– 184 KB

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce). Cryptographic Boolean Functions and Applications is a

Horn functions and submodular boolean fu
✍ Oya Ekin; Peter L. Hammer; Uri N. Peled πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 953 KB

After providing a simple characterization of Horn functions (i.e., those Boolean functions that have a Horn DNF), we study in detail the special class of submodular functions. Every prime implicant of such a function involves at most one complemented and at most one uncomplemented variable, and base

Worst-case groundness analysis using pos
✍ Michael Codish πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 61 KB

This note illustrates a theoretical worst-case scenario for groundness analyses obtained through abstract interpretation over the abstract domain of positive Boolean functions. A sequence of programs is given for which any Pos-based abstract interpretation for groundness analysis follows an exponent

Learning boolean functions
✍ Qian Ping Gu; Akira Maruoka πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 587 KB