THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

被引:1
作者
JOHNSON, DS [1 ]
机构
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
关键词
D O I
10.1016/0196-6774(84)90010-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:595 / 609
页数:15
相关论文
共 35 条
[21]   COMMUNICATION COMPLEXITY [J].
PAPADIMITRIOU, CH ;
SIPSER, M .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :260-269
[22]  
PATURI R, 1984, 25TH P ANN S F COMP
[23]  
SULLIVAN G, 1984, 25TH P ANN S F COMP
[24]  
TAYLOR RN, 1983, ACTA INFORM, V19, P57, DOI 10.1007/BF00263928
[25]  
Thompson C. D., 1980, THESIS CARNEGIE MELL
[26]   SOME COMPLEXITY RESULTS IN THE DESIGN OF DEADLOCK-FREE PACKET SWITCHING-NETWORKS [J].
TOUEG, S ;
STEIGLITZ, K .
SIAM JOURNAL ON COMPUTING, 1981, 10 (04) :702-712
[27]  
TOUEG S, 1979, 11TH P ACM S THEOR C, P89
[28]  
Ullman J., 1984, COMPUTATIONAL ASPECT
[29]   A NATURAL ENCODING SCHEME PROVED PROBABILISTIC POLYNOMIAL COMPLETE [J].
VAZIRANI, UV ;
VAZIRANI, VV .
THEORETICAL COMPUTER SCIENCE, 1983, 24 (03) :291-300
[30]  
Vishkin U., 1983, 24th Annual Symposium on Foundations of Computer Science, P146, DOI 10.1109/SFCS.1983.77