Using variable-entered karnaugh maps to solve boolean equations

DOI10.1080/00207160108805094zbMath0988.06010OpenAlexW2020275502MaRDI QIDQ2752264

Ali Muhammad Ali Rushdi

Publication date: 30 January 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160108805094

zbMATH Keywords

Boolean equationssuccessive elimination of variablesvariable-entered Karnaugh maps

Mathematics Subject Classification ID

Related Items (6)

Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations ⋮ Algebraic Methods Versus Map Methods Of Solving Boolean Equations ⋮ Algebraic Methods Versus Map Methods Of Solving Boolean Equations ⋮ Two-Level Multiple-Output Logic Minimization Using A Single Function ⋮ A purely map procedure for two-level multiple-output logic minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved variable-entered Karnaugh map procedures
• Symbolic Reliability Analysis with the Aid of Variable-Entered Karnaugh Maps
• Graph-Based Algorithms for Boolean Function Manipulation
• Meet and Join Derivatives and Their Use in Switching Theory
• Comments on "Some additions to solution of switching equations based on a tabular algebra

This page was built for publication: Using variable-entered karnaugh maps to solve boolean equations