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

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1980年 / 20卷 / 01期

关键词：

D O I：

10.1016/0022-0000(80)90001-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：1 / 17

页数：17

相关论文

共 50 条

[21] Optimal Time-Complexity Speed Planning for Robot Manipulators
Consolini, Luca
Locatelli, Marco
Minari, Andrea
Nagy, Akos
Vajk, Istvan
IEEE TRANSACTIONS ON ROBOTICS, 2019, 35 (03) : 790 - 797
[22] A NEURAL SORTING NETWORK WITH O(1) TIME-COMPLEXITY
CHEN, WT
HSIEH, KR
INFORMATION PROCESSING LETTERS, 1993, 45 (06) : 309 - 313
[23] UNIVERSAL QUANTIFIERS AND TIME-COMPLEXITY OF RANDOM-ACCESS MACHINES
GRANDJEAN, E
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 171 : 366 - 379
[24] ON THE TIME-COMPLEXITY OF WORST-CASE SYSTEM-IDENTIFICATION
POOLLA, K
TIKKU, A
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (05) : 944 - 950
[25] UNIVERSAL QUANTIFIERS AND TIME-COMPLEXITY OF RANDOM-ACCESS MACHINES
GRANDJEAN, E
MATHEMATICAL SYSTEMS THEORY, 1985, 18 (02): : 171 - 187
[26] A NOTE ON NEURAL SORTING NETWORKS WITH O(1) TIME-COMPLEXITY
YAO, X
INFORMATION PROCESSING LETTERS, 1995, 56 (05) : 253 - 254
[27] AN OPTIMAL ALGORITHM WITH UNKNOWN TIME-COMPLEXITY FOR CONVEX MATRIX SEARCHING
LARMORE, LL
INFORMATION PROCESSING LETTERS, 1990, 36 (03) : 147 - 151
[28] Complexity of Simple Programs Preface
Woods, Damien
Neary, Turlough
Seda, Anthony K.
THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 1 - 1
[29] Variable complexity of simple programs
Holzer, Markus
Kutrib, Martin
FUNDAMENTA INFORMATICAE, 2006, 74 (04) : 511 - 528
[30] Time-complexity of the word problem for semigroups and the Higman Embedding Theorem
Birget, JC
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1998, 8 (02) : 235 - 294

← 1 2 3 4 5 →