A CHARACTERIZATION OF TIME-COMPLEXITY BY SIMPLE LOOP PROGRAMS

被引：9

作者：

KASAI, T ^{[1
]}

ADACHI, A ^{[1
]}

机构：

[1] IBM JAPAN LTD,MINATO KU,TOKYO 106,JAPAN

来源：

关键词：

D O I：

10.1016/0022-0000(80)90001-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1 / 17

页数：17

共 12 条

[1]

ADACHI A, UNPUBLISHED

[2]

Borodin A. B., 1973, CURRENTS THEORY COMP, P35

[3]

Constable R. L., 1970, IEEE conference record of 1970 11th annual symposium on switching and automata theory, P60

[4]

CONSTABLE RL, 1970, 2ND P ANN S THEOR CO, P1

[5]

Cook S. A., 1973, Journal of Computer and System Sciences, V7, P354, DOI 10.1016/S0022-0000(73)80029-7

[6]

GOETZE B, 1978, 78 MATH F COMP SCI L

[7]

GRZEGORCZYK A, 1953, SOME CLASSES RECURSI, P1

[8] EVEN SIMPLE PROGRAMS ARE HARD TO ANALYZE [J].

JONES, ND ;

MUCHNICK, SS .

[9]

KASAI T, 1977, 2ND P IBM S MATH F C

[10]

KASAI T, 1979, 74 MATH F COMP SCI L