Minterm based search algorithms for two-level minimization of discrete functions
Techniques for the heuristic and exact two-level minimization of Boolean and multivalued functions are presented. The work is based on a previously existing algorithmic framework for two-level minimization known as directed search. This method is capable of selecting covering prime implicants wit...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://dspace.library.uvic.ca//handle/1828/9643 |