LOWER BOUND OF 1/2N2 ON LINEAR SEARCH PROGRAMS FOR KNAPSACK PROBLEM

被引：40

作者：

DOBKIN, D

LIPTON, RJ

机构：

[1] Department of Computer Science, Yale University, New Haven

来源：

关键词：

D O I：

10.1016/0022-0000(78)90026-0

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：413 / 417

页数：5

共 11 条

[1]

DOBKIN D, 1975, AUTOMATA THEORY FORM

[2]

DOBKIN D, 1974, MAY ACM S THEOR COMP

[3]

DOBKIN D, 1975, 52 YAL COMP SCI RES

[4]

DOBKIN DP, UNPUBLISHED

[5]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[6]

Rabin M. O., 1972, Journal of Computer and System Sciences, V6, P639, DOI 10.1016/S0022-0000(72)80034-5

[7]

REINGOLD E, 1971, 12TH ANN S SWITCH AU

[8]

SCHNORR CP, UNPUBLISHED

[9]

SHENG EL, 1969, THRESHOLD LOGIC

[10]

Spira P. M., 1972, Journal of Computer and System Sciences, V6, P205, DOI 10.1016/S0022-0000(72)80002-3