A Recursive Paradigm to Solve Boolean Relations

DOI10.1109/TC.2008.165zbMath1367.94472OpenAlexW2149693580WikidataQ56892109 ScholiaQ56892109MaRDI QIDQ4974982

David Bañeres Besora, Mike Kishinevsky, Jordi Cortadella

Publication date: 8 August 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2008.165

Mathematics Subject Classification ID

Related Items (4)

Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations ⋮ On the suppression of variables in Boolean equations ⋮ Towards Parallel Boolean Functional Synthesis ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations

This page was built for publication: A Recursive Paradigm to Solve Boolean Relations