LOWER BOUNDS FOR THE ADDITION SUBTRACTION OPERATIONS IN ORTHOGONAL RANGE QUERIES AND RELATED PROBLEMS

被引：4

|

作者：

WILLARD, DE

机构：

来源：

INFORMATION AND COMPUTATION | 1989年 / 82卷 / 01期

关键词：

D O I：

10.1016/0890-5401(89)90064-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：45 / 64

页数：20

相关论文

共 25 条

[21] Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
Sen, S
THEORETICAL COMPUTER SCIENCE, 1997, 188 (1-2) : 59 - 78
[22] Schema building profiles among elementary school students in solving problems related to operations of addition to fractions on the basis of mathematic abilities
Gembong, S.
Suwarsono, S. T.
Prabowo
INTERNATIONAL CONFERENCE ON MATHEMATICS, SCIENCE AND EDUCATION 2017 (ICMSE2017), 2018, 983
[23] Schema of construction profiles among elementary school students in solving problems related to addition operations of fractions on the basis of mathematic abilities
Gembong, S.
INTERNATIONAL CONFERENCE ON SCIENCE AND APPLIED SCIENCE (ICSAS) 2018, 2018, 2014
[24] Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
Manurangsi, Pasin
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 62 - 81
[25] Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
Manurangsi, Pasin
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 62 - 81