On the Polynomial Form of Boolean Functions: Derivations and Applications

Authors:
Winfrid G. Schneeweiss
Affiliations:
Fern Univ., Hagen, Germany
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 4
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Boolean functions with engineering applications and computer programs

Boolean functions with engineering applications and computer programs
A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic Applications

IEEE Transactions on Computers
Probabilistic Aspects of Boolean Switching Functions via a New Transform

Journal of the ACM (JACM)

A Note on the Polynomial Form of Boolean Functions and Related Topics

IEEE Transactions on Computers
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

IEEE Transactions on Computers
Fault tree analysis of software-controlled component systems based on second-order probabilities

ISSRE'09 Proceedings of the 20th IEEE international conference on software reliability engineering
Comments on a numerical method for solving Boolean equations

Information Sciences: an International Journal

Quantified Score

Hi-index	14.99

Visualization

Abstract

After discussing a few derivations of the canonical, i.e., unique, polynomial form of a Boolean function, various interesting applications of this form are discussed. Mainly, the polynomial form is shown to be very useful for a deeper understanding of switching functions with emphasis on fault tolerant electronics systems.