Generating test examples for heuristic Boolean minimization

Authors:
D. L. Ostapko;S. J. Hong
Affiliations:
IBM System Products Division Laboratory in Poughkeepsie, New York;IBM System Products Division Laboratory in Poughkeepsie, New York
Venue:
IBM Journal of Research and Development
Year:
1974

Citing 2
Cited 1

A Method for the Fast Approximate Solution of Large Prime Implicant Charts

IEEE Transactions on Computers
Recursive Operators for Prime Implicant and Irredundant Normal Form Determination

IEEE Transactions on Computers

Heuristic Minimization of MVL Functions: A Direct Cover Approach

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.