BANDWIDTH CONSTRAINTS ON PROBLEMS COMPLETE FOR POLYNOMIAL-TIME

被引：12
作者：
SUDBOROUGH, IH
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1983年 / 26卷 / 1-2期
关键词：
D O I：
10.1016/0304-3975(83)90078-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：25 / 52
页数：28
相关论文
共 41 条
  • [11] COOK SA, 1979, 11TH P ANN ACM THEOR, P308
  • [12] COOK SA, 1980, 14180 U TOR DEP COMP
  • [13] CUTHILL E, 1969, P ACM NATIONAL C, V24, P157
  • [14] SPACE BOUNDS FOR PROCESSING CONTENTLESS INPUTS
    FREEDMAN, AR
    LADNER, RE
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (01) : 118 - 128
  • [15] COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION
    GAREY, MR
    GRAHAM, RL
    JOHNSON, DS
    KNUTH, DE
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (03) : 477 - 495
  • [16] HARTMANIS J, 1975, 16TH P IEEE S F COMP, P65
  • [17] Hopcroft J.E., 1979, INTRO AUTOMATA THEOR
  • [18] SOME RESULTS ON TAPE-BOUNDED TURING MACHINES
    HOPCROFT, JE
    ULLMAN, JD
    [J]. JOURNAL OF THE ACM, 1969, 16 (01) : 168 - &
  • [19] Immerman N., 1979, 20th Annual Symposium of Foundations of Computer Science, P337, DOI 10.1109/SFCS.1979.21
  • [20] Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2
12345