EVEN SIMPLE PROGRAMS ARE HARD TO ANALYZE

被引：27

作者：

JONES, ND ^{[1
]}

MUCHNICK, SS ^{[1
]}

机构：

[1] UNIV KANSAS,DEPT COMP SCI,LAWRENCE,KS 66045

来源：

关键词：

D O I：

10.1145/322003.322016

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：338 / 350

页数：13

共 9 条

[1]

Constable R. L., 1972, Journal of Computer and System Sciences, V6, P480, DOI 10.1016/S0022-0000(72)80029-1

GRIFFITHS, TV .

[3]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[4] SPACE-BOUNDED REDUCIBILITY AMONG COMBINATORIAL PROBLEMS [J].

JONES, ND .

[5]

JONES ND, 1975, TR751 U KANS COMPTR

[6]

MEYER AR, 1967, RC1817 IBM TJ WATS R

[7]

Seiferas J. I., 1973, 14th Annual Symposium on Switching Automata Theory, P130, DOI 10.1109/SWAT.1973.25

[8]

Stockmeyer LJ, 1973, 5TH P ANN ACM S THEO, P1, DOI DOI 10.1145/800125.804029

[9]

YANOV Y, 1960, PROBLEMS CYBERNETICS, V1, P82