On the suppression of variables in Boolean equations
This paper studies the suppression of variables from a Boolean equation, thus yielding a Boolean equation, derived from the parent equation, whose solutions are exactly those of the parent equation that do not involve the suppressed variables. The resultant of suppression, defined in the paper, is derived in a relatively simple way from the original Boolean equation. Three sets of solutions associated with suppression are defined and the relations among the sets are established; an example demonstrates these relations. Finally, the resultant of suppression is applied to the examples given by Marin and Ledley, showing that in such cases it is advantageous to solve the resultant of suppression of certain variables rather than solving the original equation and filtering the desired solutions from the results, in order to save computational effort.
- scientific article; zbMATH DE number 4116598
- Solving non-linear Boolean equation systems by variable elimination
- On solvability of Boolean equations
- On influences of Boolean variables and their computation
- On systems of Boolean equations
- On the superposition of Boolean functions
- Boolean equations with many unknowns
- Certain Boolean equations
- scientific article; zbMATH DE number 4008465
- A Recursive Paradigm to Solve Boolean Relations
- scientific article; zbMATH DE number 1634465 (Why is no real title available?)
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 3501560 (Why is no real title available?)
- scientific article; zbMATH DE number 1963548 (Why is no real title available?)
- scientific article; zbMATH DE number 3196576 (Why is no real title available?)
- Synthesis of TANT networks using a Boolean analyser
This page was built for publication: On the suppression of variables in Boolean equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628298)