Skip to Main Content
This article describes simple methods of generating many-variable test-case problems for heuristic logic minimization studies. Covering problems and coloring problems are converted into Boolean functions that are useful test cases for minimization.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.