A polynomial algorithm for minimal interval representation - HEC Paris - École des hautes études commerciales de Paris Accéder directement au contenu
Article Dans Une Revue Journal of Algorithms in Cognition, Informatics and Logic Année : 1992

A polynomial algorithm for minimal interval representation

Itzhak Gilboa
  • Fonction : Auteur
  • PersonId : 867909
Anat Fischer
  • Fonction : Auteur
Moshe Shpitalni
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-00481389 , version 1 (06-05-2010)

Identifiants

Citer

Itzhak Gilboa, Anat Fischer, Moshe Shpitalni. A polynomial algorithm for minimal interval representation. Journal of Algorithms in Cognition, Informatics and Logic, 1992, Vol.13, n°4, pp. 546-563. ⟨10.1016/0196-6774(92)90055-H⟩. ⟨hal-00481389⟩

Collections

HEC
130 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More