A UNIFIED LOWER BOUND FOR SELECTION AND SET PARTITIONING PROBLEMS

被引：22

作者：

KIRKPATRICK, DG

机构：

来源：

关键词：

D O I：

10.1145/322234.322245

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：150 / 165

页数：16

共 15 条

[1]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[2]

DODGSON CL, 1883, ST JAMES GAZETT 0801, P5

[3] COUNTING APPROACH TO LOWER BOUNDS FOR SELECTION PROBLEMS [J].

FUSSENEGGER, F ;

GABOW, HN .

[4]

FUSSENEGGER F, 1976, 17TH P IEEE S F COMP, P178

[5]

HADIAN A, 1969, 4 C MATH SOC JAN BOL, P585

[6]

Hyafil L., 1976, SIAM Journal on Computing, V5, P109, DOI 10.1137/0205010

[7]

KIRKPATRICK DG, 1974, 74 U TOR DEP COMP SC

[8]

Kislitsyn S. S., 1964, SIBIRSKII MATEMATICH, V5, P557

[9]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[10]

Pratt V. R., 1973, 14th Annual Symposium on Switching Automata Theory, P70, DOI 10.1109/SWAT.1973.18