LOWER BOUNDS FOR SORTING OF SUMS

被引：4

作者：

DIETZFELBINGER, M ^{[1
]}

机构：

[1] UNIV DORTMUND,LEHRSTUHL INFORMAT 2,D-4600 DORTMUND 50,FED REP GER

来源：

THEORETICAL COMPUTER SCIENCE | 1989年 / 66卷 / 02期

关键词：

D O I：

10.1016/0304-3975(89)90132-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：137 / 155

页数：19

共 9 条

[1] LOWER BOUND ARGUMENTS WITH INACCESSIBLE NUMBERS [J].

DIETZFELBINGER, M ;

MAASS, W .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (03) :313-335

[2] COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVES [J].

DOBKIN, DP ;

LIPTON, RJ .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) :86-91

[3]

Fredman M. L., 1976, Theoretical Computer Science, V1, P355, DOI 10.1016/0304-3975(76)90078-5

[4] SORTING X + Y [J].

HARPER, LH ;

PAYNE, TH ;

SAVAGE, JE ;

STRAUS, E .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :347-349

[5] BALANCING POSET EXTENSIONS [J].

KAHN, J ;

SAKS, M .

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1984, 1 (02) :113-126

[6]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

[7] COMPARISONS BETWEEN LINEAR FUNCTIONS CAN HELP [J].

SNIR, M .

THEORETICAL COMPUTER SCIENCE, 1982, 19 (03) :321-330

[8] EXPONENTIAL LOWER BOUNDS FOR SOME NP-COMPLETE PROBLEMS IN A RESTRICTED LINEAR DECISION TREE MODEL [J].

UKKONEN, E .

BIT, 1983, 23 (02) :181-192

[9]

[No title captured]

← 1 →