Classification of Boolean Functions by the Invariants of Their Matrix Representation

    loading  Checking for direct PDF access through Ovid

Abstract

A variant of matrix representation for Boolean functions is designed such that these functions can be classified by matrix invariants. By way of example, the Deutsch problem is solved to illustrate the advantages of this classification.

Related Topics

    loading  Loading Related Articles