AN OMEGA-(N LOG N) LOWER BOUND FOR DECOMPOSING A SET OF POINTS INTO CHAINS

被引：3

|

作者：

BLONIARZ, PA

RAVI, SS

机构：

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 31卷 / 06期

关键词：

D O I：

10.1016/0020-0190(89)90095-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：319 / 322

页数：4

相关论文

共 50 条

[1] ON THE OMEGA-(N LOG N) LOWER BOUND FOR CONVEX-HULL AND MAXIMAL-VECTOR DETERMINATION
VANEMDEBOAS, P
[J]. INFORMATION PROCESSING LETTERS, 1980, 10 (03) : 132 - 136
[2] RELATIONS BETWEEN OMEGA-(N) AND OMEGA-(N)
MERCIER, A
[J]. AMERICAN MATHEMATICAL MONTHLY, 1990, 97 (06): : 503 - 505
[3] AN OMEGA-(N4/3) LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF THE NTH DEGREE CONVOLUTION
BLUM, N
[J]. THEORETICAL COMPUTER SCIENCE, 1985, 36 (01) : 59 - 69
[4] An Ω(√log log n) lower bound for routing in optical networks
Goldberg, LA
Jerrum, M
Mackenzie, PD
[J]. SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 1083 - 1098
[5] An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model
Ailon, Nir
[J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2016, 8 (01)
[6] N-LOG-N LOWER BOUND ON SYNCHRONOUS COMBINATIONAL COMPLEXITY
HARPER, LH
[J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1977, 64 (02) : 300 - 306
[7] N X LOG N LOWER BOUND ON SYNCHRONOUS COMBINATIONAL COMPLEXITY
HARPER, LH
[J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (02): : A317 - A317
[8] OMEGA(N LOG N) LOWER BOUNDS ON LENGTH OF BOOLEAN-FORMULAS
FISCHER, MJ
MEYER, AR
PATERSON, MS
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 416 - 427
[9] SOME REMARKS CONCERNING NUMBER THEORETIC FUNCTIONS OMEGA-(N) AND OMEGA(N)
DRESSLER, RE
VANDELUN.J
[J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 41 (02) : 403 - 406
[10] A lower bound for the number of polygonizations of N points in the plane
Garcia, A
Tejel, J
[J]. ARS COMBINATORIA, 1998, 49 : 3 - 19

← 1 2 3 4 5 →