Large systems of Boolean functions: realization by modular arithmetic methods
From MaRDI portal
Publication:2487679
The author introduces and studies modular arithmetical polynomial representations of systems of Boolean functions. Such codings may be used in computationally efficient methods to treat large systems of Boolean functions. Both unimodular and multimodular representations are considered, and upper bounds for the ranges of coefficients needed are presented. All concepts and methods are illustrated by detailed examples.
Recommendations
- Representation of Boolean functions by arithmetic polynomials
- Realization of systems of Boolean functions by linear arithmetic polynomials with masking
- Modular forms of systems of k-valued functions of the algebra of logic
- Realization of corteges of Boolean functions by linear arithmetic polynomials
- Realization of Boolean functions by one linear arithmetic polynomial with masking
Cited in
(6)- Realization of systems of Boolean functions by linear arithmetic polynomials with masking
- Modules with paraphase input variables that are universal in the class of all Boolean functions
- Multiple logic computations
- scientific article; zbMATH DE number 1120573 (Why is no real title available?)
- scientific article; zbMATH DE number 910728 (Why is no real title available?)
- Realization of corteges of Boolean functions by linear arithmetic polynomials
This page was built for publication: Large systems of Boolean functions: realization by modular arithmetic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487679)
