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

共 50 条

[1] ON THE SPACE AND TIME-COMPLEXITY OF FUNCTIONS COMPUTABLE BY SIMPLE PROGRAMS
CHAN, TH
IBARRA, OH
SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 708 - 716
[2] Lower-bound time-complexity analysis of logic programs
King, A
Shen, K
Benoy, F
LOGIC PROGRAMMING - PROCEEDINGS OF THE 1997 INTERNATIONAL SYMPOSIUM, 1997, : 261 - 275
[3] EQUIVALENCE IN TIME-COMPLEXITY OF SEVERAL PROBLEMS
IVANOV, EA
CYBERNETICS, 1983, 19 (06): : 769 - 774
[4] ON THE AVERAGE TIME-COMPLEXITY OF SET PARTITIONING
SPECKENMEYER, E
KEMP, R
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 440 : 369 - 381
[5] A NOTE ON DETERMINISTIC AND NONDETERMINISTIC TIME-COMPLEXITY
EVEN, S
LONG, TJ
YACOBI, Y
INFORMATION AND CONTROL, 1982, 55 (1-3): : 117 - 124
[6] TIME-COMPLEXITY OF LOOP-FREE 2-WAY PUSHDOWN-AUTOMATA
RYTTER, W
INFORMATION PROCESSING LETTERS, 1983, 16 (03) : 127 - 129
[7] ON THE TIME-COMPLEXITY FOR CIRCUMSCRIBING A CONVEX POLYGON
WOO, TC
LEE, HC
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 30 (03): : 362 - 363
[8] On the Time-Complexity of Robust and Amnesic Storage
Dobre, Dan
Majuntke, Matthias
Suri, Neeraj
PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 197 - 216
[9] TIME-COMPLEXITY OF MONTE-CARLO RADIOSITY
SHIRLEY, P
COMPUTERS & GRAPHICS-UK, 1992, 16 (01): : 117 - 120
[10] TIME-COMPLEXITY FOR SERIAL AND PARALLEL PROPAGATION IN IMAGES
DANIELSSON, PE
TANIMOTO, S
PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS, 1983, 435 : 60 - 67