A polynomial algorithm for minimal interval representation

Itzhak Gilboa, Anat Fischer and Moshe Shpitalni

Post-Print from HAL

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.

Keywords: Gray code; Switching function; Algorithm analysis; Polynomial time; Three dimensional representation; Geometrical model; Solid geometry; Computer system; Code Gray; Fonction commutation; Analyse algorithme; Temps polynomial; Représentation tridimensionnelle; Modèle géométrique; Géométrie solide; Système informatique (search for similar items in EconPapers)
Date: 1992-12
References: Add references at CitEc
Citations:

Published in Journal of Algorithms in Cognition, Informatics and Logic, 1992, Vol.13, n°4, pp. 546-563. ⟨10.1016/0196-6774(92)90055-H⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00481389

DOI: 10.1016/0196-6774(92)90055-H

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().