Tabular techniques for Reed—Muller logic
A.E.A. Almaini, P.F. Thomson, David Roy Hanson
Abstract
A.E.A. Almaini, P.F. Thomson, David Roy Hanson
Abstract
Tabular techniques are described for the conversion between boolean expressions and Reed-Muller polynomials, and for the derivation of fixed polarities. The techniques are simple, systematic, and can be used manually or programmed on a computer. Further, they can be used for any number of variables and hence overcome map limitations. Computer programs have been developed to implement the algorithms.
OpenAlex reports 55 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Tabular techniques are described for the conversion between boolean expressions and Reed-Muller polynomials, and for the derivation of fixed polarities. The techniques are simple, systematic, and can be used manually or programmed on a computer. Further, they can be used for any number of variables and hence overcome map limitations. Computer programs have been developed to implement the algorithms.
Key concepts: Simple (philosophy), Computer science, Algorithm, Arithmetic, Boolean function, Theoretical computer science, Mathematics, Epistemology