COMPARISONS BETWEEN LINEAR FUNCTIONS CAN HELP

被引:4
作者
SNIR, M [1 ]
机构
[1] UNIV EDINBURGH,DEPT COMP SCI,EDINBURGH EH9 3JZ,MIDLOTHIAN,SCOTLAND
关键词
D O I
10.1016/0304-3975(82)90041-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:321 / 330
页数:10
相关论文
共 17 条
[1]   NONLINEAR LOWER BOUND ON LINEAR SEARCH TREE PROGRAMS FOR SOLVING KNAPSACK PROBLEMS [J].
DOBKIN, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (01) :69-73
[2]   LOWER BOUND OF 1/2N2 ON LINEAR SEARCH PROGRAMS FOR KNAPSACK PROBLEM [J].
DOBKIN, D ;
LIPTON, RJ .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (03) :413-417
[3]   COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVES [J].
DOBKIN, DP ;
LIPTON, RJ .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) :86-91
[4]   COMPLEXITY OF COMPUTING MEASURE OF U[AI, BI] [J].
FREDMAN, ML ;
WEIDE, B .
COMMUNICATIONS OF THE ACM, 1978, 21 (07) :540-544
[5]  
Grunbaum B, 1967, CONVEX POLYTOPES
[6]  
HOLLADAY JC, 1957, ANN MATH STUDIES, V39, P189
[7]  
Knuth D. E., 1973, ART COMPUTER PROGRAM
[8]   FINDING MAXIMA OF A SET OF VECTORS [J].
KUNG, HT ;
LUCCIO, F ;
PREPARATA, FP .
JOURNAL OF THE ACM, 1975, 22 (04) :469-476
[9]  
Rabin M. O., 1972, Journal of Computer and System Sciences, V6, P639, DOI 10.1016/S0022-0000(72)80034-5
[10]  
REINGOLD EM, 1971, 12TH P IEEE S SWITCH, P216