COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVES

被引:62
作者
DOBKIN, DP
LIPTON, RJ
机构
[1] Department of Computer Science, Yale University, New Haven
基金
美国国家科学基金会;
关键词
D O I
10.1016/0022-0000(79)90054-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:86 / 91
页数:6
相关论文
共 7 条
[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]  
DOBKIN D, 1974, MAY ACM S THEOR COMP
[4]  
Grunbaum B, 1967, CONVEX POLYTOPES
[5]  
LEFSCHETZ S, 1953, ALGEBRAIC GEOMETRY
[6]  
RABIN M, 1972, J COMPUT SYSTEM SCI, V13, P639
[7]  
REINGOLD EM, 1971, 12TH P IEEE S SWITCH, P216