A polynomial algorithm for minimal interval representation

Anat Fischer; Itzhak Gilboa; Moshe Shpitalni

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

A polynomial algorithm for minimal interval representation

Anat Fischer^*
, Itzhak Gilboa
, Moshe Shpitalni

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/0196-6774(92)90055-H
State	Published - Dec 1992
Externally published	Yes

Access to Document

10.1016/0196-6774(92)90055-H

Cite this

@article{7db1a99e0cdc4e789de3dcf77e1237e2,

title = "A polynomial algorithm for minimal interval representation",

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.",

author = "Anat Fischer and Itzhak Gilboa and Moshe Shpitalni",

year = "1992",

month = dec,

doi = "10.1016/0196-6774(92)90055-H",

language = "אנגלית",

volume = "13",

pages = "546--563",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

T1 - A polynomial algorithm for minimal interval representation

AU - Fischer, Anat

AU - Gilboa, Itzhak

AU - Shpitalni, Moshe

PY - 1992/12

Y1 - 1992/12

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/44049109986

U2 - 10.1016/0196-6774(92)90055-H

DO - 10.1016/0196-6774(92)90055-H

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:44049109986

SN - 0196-6774

VL - 13

SP - 546

EP - 563

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 4

ER -

A polynomial algorithm for minimal interval representation

Abstract

Access to Document

Other files and links

Fingerprint

Cite this