LOWER TIME-BOUNDS FOR INTEGER PROGRAMMING WITH 2 VARIABLES

被引:2
作者
LAUTEMANN, C [1 ]
HEIDE, FMAD [1 ]
机构
[1] UNIV FRANKFURT,FACHBEREICH INFORMAT 20,D-6000 FRANKFURT,FED REP GER
关键词
INTEGER PROGRAMMING - LOWER TIME BOUNDS;
D O I
10.1016/0020-0190(85)90042-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
(Edited Abstract)
引用
收藏
页码:101 / 105
页数:5
相关论文
共 7 条
[1]  
Ben-Or Michael, 1983, P 15 ANN ACM S THEOR, P80
[2]  
BOAS PV, 1984, COMMUNICATION
[3]  
DOBKIN D, 1975, J COMPUT SYST SCI, V16, P417
[4]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[5]   A LOWER TIME BOUND FOR THE KNAPSACK-PROBLEM ON RANDOM-ACCESS MACHINES [J].
KLEIN, P ;
AUFDERHEIDE, FM .
ACTA INFORMATICA, 1983, 19 (04) :385-395
[6]  
LENSTRA HW, INTEGER PROGRAMMING
[7]  
LENSTRA HW, 1981, 8103 CTR MATH COMP S