A POLYNOMIAL ALGORITHM FOR MINIMAL INTERVAL REPRESENTATION

被引：0
|
作者：
FISCHER, A
GILBOA, I
SHPITALNI, M
机构：
[1] TECHNION ISRAEL INST TECHNOL,HAIFA,ISRAEL
[2] NORTHWESTERN UNIV,EVANSTON,IL 60208
[3] UNIV CALIF SANTA BARBARA,SANTA BARBARA,CA 93106
来源：
JOURNAL OF ALGORITHMS | 1992年 / 13卷 / 04期
关键词：
D O I：
10.1016/0196-6774(92)90055-H
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. © 1992.
引用
收藏
页码：546 / 563
页数：18
相关论文
共 50 条
12345