ON THE AVERAGE TIME-COMPLEXITY OF SET PARTITIONING

被引：0

作者：

SPECKENMEYER, E ^{[1
]}

KEMP, R ^{[1
]}

机构：

[1] UNIV DORTMUND, FACHBEREICH INFORMAT, W-4600 DORTMUND 50, GERMANY

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：369 / 381

页数：13

共 50 条

[1] EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS
VANDERNAT, M
ANGEWANDTE INFORMATIK, 1987, (12): : 533 - 536
[2] AN NP-HARD OPEN SHOP SCHEDULING PROBLEM WITH POLYNOMIAL AVERAGE TIME-COMPLEXITY
LU, L
POSNER, ME
MATHEMATICS OF OPERATIONS RESEARCH, 1993, 18 (01) : 12 - 38
[3] EQUIVALENCE IN TIME-COMPLEXITY OF SEVERAL PROBLEMS
IVANOV, EA
CYBERNETICS, 1983, 19 (06): : 769 - 774
[4] A NOTE ON DETERMINISTIC AND NONDETERMINISTIC TIME-COMPLEXITY
EVEN, S
LONG, TJ
YACOBI, Y
INFORMATION AND CONTROL, 1982, 55 (1-3): : 117 - 124
[5] ON THE TIME-COMPLEXITY FOR CIRCUMSCRIBING A CONVEX POLYGON
WOO, TC
LEE, HC
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 30 (03): : 362 - 363
[6] 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
[7] TIME-COMPLEXITY OF MONTE-CARLO RADIOSITY
SHIRLEY, P
COMPUTERS & GRAPHICS-UK, 1992, 16 (01): : 117 - 120
[8] 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
[9] A CHARACTERIZATION OF TIME-COMPLEXITY BY SIMPLE LOOP PROGRAMS
KASAI, T
ADACHI, A
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 1 - 17
[10] TIME-COMPLEXITY OF BOOLEAN FUNCTIONS ON CREW PRAMS
KUTYLOWSKI, M
SIAM JOURNAL ON COMPUTING, 1991, 20 (05) : 824 - 833