THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引:71
作者
JOHNSON, DS
机构
关键词
D O I
10.1016/0196-6774(82)90018-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:182 / 195
页数:14
相关论文
共 43 条
[1]  
BALL MO, 1981, 81012 U MAR COLL BUS
[2]   INHERENT INTRACTABILITY OF CERTAIN CODING PROBLEMS [J].
BERLEKAMP, ER ;
MCELIECE, RJ ;
VANTILBORG, HCA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (03) :384-386
[3]  
BERMAN FD, 1982, UNPUB OPTIMAL TILE S
[4]   DOMINATING SETS IN CHORDAL GRAPHS [J].
BOOTH, KS ;
JOHNSON, JH .
SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :191-199
[5]  
BURR S, 1982, COMMUNICATION
[6]   COVERING REGIONS BY RECTANGLES [J].
CHAIKEN, S ;
KLEITMAN, DJ ;
SAKS, M ;
SHEARER, J .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04) :394-410
[7]  
CHAZELLE B, 1979, 11TH P ANN ACM S THE, P38
[8]  
CHAZELLE BM, 1981, 13TH P ACM S THEOR C, P70
[9]  
CHAZELLE BM, 1980, CMUCS80150 CARN MELL
[10]  
CHAZELLE BM, 1979, 796A U AR DEP COMP S