BANDWIDTH CONSTRAINTS ON PROBLEMS COMPLETE FOR POLYNOMIAL-TIME

[1] LOWER BOUNDS ON SPACE COMPLEXITY FOR CONTEXT-FREE RECOGNITION [J]. ACTA INFORMATICA, 1979, 12 (01) : 33 - 61

[2] AN ALGORITHM FOR REDUCING THE BANDWIDTH OF A MATRIX OF SYMMETRICAL CONFIGURATION [J]. COMPUTER JOURNAL, 1965, 8 (03) : 264 - 272

[3] ARANY I, 1972, 1971 P IFIP C, P1246

[4] RELATING TIME AND SPACE TO SIZE AND DEPTH [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 733 - 744

[5] ALTERNATION [J]. JOURNAL OF THE ACM, 1981, 28 (01) : 114 - 133

[6] MINIMIZING BANDWIDTH OF SPARSE SYMMETRIC MATRICES [J]. COMPUTING, 1973, 11 (02) : 103 - 110

[7] CHUNG MJ, 1980, 15TH P C INF SCI SYS

[8] CHVATALOVA J, 1975, 24 U W ONT DEP COMP

[9] CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J]. JOURNAL OF THE ACM, 1971, 18 (01) : 4 - &

[10] OBSERVATION ON TIME-STORAGE TRADE OFF [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 308 - 316

[1] LOWER BOUNDS ON SPACE COMPLEXITY FOR CONTEXT-FREE RECOGNITION [J]. ACTA INFORMATICA, 1979, 12 (01) : 33 - 61

[2] AN ALGORITHM FOR REDUCING THE BANDWIDTH OF A MATRIX OF SYMMETRICAL CONFIGURATION [J]. COMPUTER JOURNAL, 1965, 8 (03) : 264 - 272

[3] ARANY I, 1972, 1971 P IFIP C, P1246

[4] RELATING TIME AND SPACE TO SIZE AND DEPTH [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 733 - 744

[5] ALTERNATION [J]. JOURNAL OF THE ACM, 1981, 28 (01) : 114 - 133

[6] MINIMIZING BANDWIDTH OF SPARSE SYMMETRIC MATRICES [J]. COMPUTING, 1973, 11 (02) : 103 - 110

[7] CHUNG MJ, 1980, 15TH P C INF SCI SYS

[8] CHVATALOVA J, 1975, 24 U W ONT DEP COMP

[9] CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J]. JOURNAL OF THE ACM, 1971, 18 (01) : 4 - &

[10] OBSERVATION ON TIME-STORAGE TRADE OFF [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 308 - 316