ON THE LIMITS OF COMPUTATIONS WITH THE FLOOR FUNCTION

被引:14
作者
BABAI, L
JUST, B
HEIDE, FMAD
机构
[1] EOTVOS LORAND UNIV,DEPT ALGEBRA,H-1088 BUDAPEST,HUNGARY
[2] UNIV FRANKFURT,FACHBEREICH MATH,D-6000 FRANKFURT,FED REP GER
[3] UNIV DORTMUND,FACHBEREICH INFORMAT,D-4600 DORTMUND 50,FED REP GER
关键词
D O I
10.1016/0890-5401(88)90031-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:99 / 107
页数:9
相关论文
共 8 条
[1]   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
[2]  
HASTAD J, 1986, LECT NOTES COMPUT SC, V210, P105
[3]   A LOWER TIME BOUND FOR THE KNAPSACK-PROBLEM ON RANDOM-ACCESS MACHINES [J].
KLEIN, P ;
AUFDERHEIDE, FM .
ACTA INFORMATICA, 1983, 19 (04) :385-395
[4]   LOWER TIME-BOUNDS FOR INTEGER PROGRAMMING WITH 2 VARIABLES [J].
LAUTEMANN, C ;
HEIDE, FMAD .
INFORMATION PROCESSING LETTERS, 1985, 21 (02) :101-105
[5]  
LOVASZ L, 1985, 85368OR U BONN REP
[6]   LOWER BOUNDS FOR SOLVING LINEAR DIOPHANTINE EQUATIONS ON RANDOM-ACCESS MACHINES [J].
MEYER, F ;
DERHEIDE, A .
JOURNAL OF THE ACM, 1985, 32 (04) :929-937
[7]  
Range R. M., 1986, GRAD TEXTS MATH, V108
[8]  
[No title captured]