A polynomial algorithm for minimal interval representation

Anat Fischer*, Itzhak Gilboa, Moshe Shpitalni

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)546-563
Number of pages18
JournalJournal of Algorithms
Issue number4
StatePublished - Dec 1992
Externally publishedYes


Dive into the research topics of 'A polynomial algorithm for minimal interval representation'. Together they form a unique fingerprint.

Cite this