On the efficiency of normal form systems for representing Boolean functions

Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux

Research output: Contribution to journalArticleScientificpeer-review

Abstract

A normal form system (NFS) for representing Boolean functions is thought of as a set of stratified terms over a fixed set of connectives. For a fixed NFS A, the complexity of a Boolean function f with respect to A is the minimum of the sizes of terms in A that represent f. This induces a preordering of NFSs: an NFS A is polynomially as efficient as an NFS B if there is a polynomial P with nonnegative integer coefficients such that the complexity of any Boolean function f with respect to A is at most the value of P in the complexity of f with respect to B. In this paper we study monotonic NFSs, i.e., NFSs whose connectives are increasing or decreasing in each argument. We describe the monotonic NFSs that are optimal, i.e., that are minimal with respect to the latter preorder. We show that these minimal monotonic NFSs are all equivalent. Moreover, we address some natural questions, e.g.: does optimality depend on the arity of connectives? Does it depend on the number of connectives used? We show that optimal monotonic NFSs are exactly those that use a single connective or one connective and the negation. Finally, we show that optimality does not depend on the arity of the connectives.

Original languageEnglish
Pages (from-to)341-361
JournalTheoretical Computer Science
Volume813
DOIs
Publication statusPublished - 2020
Externally publishedYes

Keywords

  • Boolean function
  • Complexity
  • Efficient representation
  • Normal form system

Fingerprint

Dive into the research topics of 'On the efficiency of normal form systems for representing Boolean functions'. Together they form a unique fingerprint.

Cite this