THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引:9
作者
JOHNSON, DS
机构
关键词
D O I
10.1016/0196-6774(82)90011-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:89 / 99
页数:11
相关论文
共 33 条
[21]   DATA ENCODINGS AND THEIR COSTS [J].
ROSENBERG, AL .
ACTA INFORMATICA, 1978, 9 (03) :273-292
[22]  
ROSENBERG AL, 1978, RC7204 IBM RES DIV R
[23]  
SAXE J, 1981, COMMUNICATION
[24]   DYNAMIC-PROGRAMMING ALGORITHMS FOR RECOGNIZING SMALL-BANDWIDTH GRAPHS IN POLYNOMIAL-TIME [J].
SAXE, JB .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04) :363-369
[25]  
SAXE JB, 1980, CMUCS80102 CARN MELL
[26]  
STORER JA, 1981, UNPUB MINIMAL NODE C
[27]  
STORER JA, 1980, 12TH P ACM S THEOR C, P201
[28]  
SUPOWIT KJ, 1980, UNPUB COMPLEXITY DRA
[29]   UNIVERSALITY CONSIDERATIONS IN VLSI CIRCUITS [J].
VALIANT, LG .
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :135-140
[30]  
WETHERELL C, 1979, IEEE T SOFTWARE ENG, V5, P514, DOI 10.1109/TSE.1979.234212