ON THE ORDERABILITY PROBLEM FOR PLA FOLDING

被引：0
作者：
RAVI, SS
机构：
来源：
DISCRETE APPLIED MATHEMATICS | 1989年 / 25卷 / 03期
关键词：
D O I：
10.1016/0166-218X(89)90010-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：317 / 320
页数：4
相关论文
共 8 条
  • [1] BIPARTITE FOLDING AND PARTITIONING OF A PLA
    EGAN, JR
    LIU, CL
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1984, 3 (03) : 191 - 199
  • [2] EVEN S., 1979, GRAPH ALGORITHMS
  • [3] Garey M.R., 1979, COMPUTERS INTRACTABI
  • [4] Hachtel G. D., 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, VCAD-1, P63, DOI 10.1109/TCAD.1982.1269996
  • [5] Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768
  • [6] THE COMPLEXITY OF NEAR-OPTIMAL PROGRAMMABLE LOGIC ARRAY FOLDING
    RAVI, SS
    LLOYD, EL
    [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (04) : 696 - 710
  • [7] RAVI SS, 1984, PLA8418 DEP COMP SCI
  • [8] [No title captured]
1