Abstract
The following problem arises in the context of object representation: given two endpoints of an interval in a Gray code table, find a Boolean function in DNF that represents this interval, with as few prime implicants as possible. This paper shows that there is a unique minimal representation and presents a polynomial algorithm that finds it.
Original language | English |
---|---|
Pages (from-to) | 546-563 |
Number of pages | 18 |
Journal | Journal of Algorithms |
Volume | 13 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1992 |
Externally published | Yes |