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 条

[31] Improved Low Time-Complexity Schedulability Test for Nonpreemptive EDF on a Multiprocessor
Lee, Seongtae
Park, Sanghyeok
Lee, Jinkyu
IEEE EMBEDDED SYSTEMS LETTERS, 2022, 14 (02) : 87 - 90
[32] EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS
VANDERNAT, M
ANGEWANDTE INFORMATIK, 1987, (12): : 533 - 536
[33] EXTREMAL PROPERTIES OF NON-DETERMINISTIC TIME-COMPLEXITY CLASSES.
van Leeuwen, Jan
1975, : 61 - 64
[34] THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR SIMPLE PROGRAMS
GURARI, EM
IBARRA, OH
JOURNAL OF THE ACM, 1981, 28 (03) : 535 - 560
[35] THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS
AFRATI, F
PAPADIMITRIOU, CH
JOURNAL OF THE ACM, 1993, 40 (04) : 891 - 916
[36] Tag Systems and the Complexity of Simple Programs
Neary, Turlough
Woods, Damien
CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015, 2015, 9099 : 11 - 16
[37] Parallel complexity of simple logic programs
Afrati, Foto
Papadimitriou, Christos H.
1600, (40):
[38] ON THE MESSAGE AND TIME-COMPLEXITY OF PROTOCOLS FOR RELIABLE BROADCASTS MULTICASTS IN NETWORKS WITH OMISSION FAILURES
TZENG, HY
SIU, KY
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (07) : 1296 - 1308
[39] IMPROVING THE TIME-COMPLEXITY OF THE COMPUTATION OF IRREDUCIBLE AND PRIMITIVE POLYNOMIALS IN FINITE-FIELDS
RIFA, J
BORRELL, J
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 352 - 359
[40] ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
Ben-Amram, Amir M.
Kristiansen, Lars
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (07) : 1451 - 1464

← 1 2 3 4 5 →