A NEW METHOD FOR PROVING LOWER BOUNDS IN THE MODEL OF ALGEBRAIC DECISION TREES

被引：0

|

作者：

UNGER, K

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 464卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：271 / 277

页数：7

相关论文

共 50 条

[41] PROVING RELATIVE LOWER BOUNDS FOR INCREMENTAL ALGORITHMS
BERMAN, AM
PAULL, MC
RYDER, BG
ACTA INFORMATICA, 1990, 27 (07) : 665 - 683
[42] NEW LOWER SOLUTION BOUNDS FOR THE CONTINUOUS ALGEBRAIC RICCATI EQUATION
Zhang, Juan
Liu, Jianzhou
ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2011, 22
[43] Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
Roei Tell
Theory of Computing Systems, 2019, 63 : 418 - 449
[44] Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
Tell, Roei
THEORY OF COMPUTING SYSTEMS, 2019, 63 (03) : 418 - 449
[45] A simple method for proving lower bounds in the zero-visibility cops and robber game
Yuan Xue
Boting Yang
Sandra Zilles
Journal of Combinatorial Optimization, 2022, 43 : 1545 - 1570
[46] A simple method for proving lower bounds in the zero-visibility cops and robber game
Xue, Yuan
Yang, Boting
Zilles, Sandra
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (05) : 1545 - 1570
[47] Tight bounds on the algebraic connectivity of Bethe trees
Rojo, Oscar
Medina, Luis
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 418 (2-3) : 840 - 853
[48] LOWER BOUNDS FOR POLYNOMIALS WITH ALGEBRAIC COEFFICIENTS
HEINTZ, J
SIEVEKING, M
THEORETICAL COMPUTER SCIENCE, 1980, 11 (03) : 321 - 330
[49] Lower bounds for dynamic algebraic problems
Frandsen, GS
Hansen, JP
Miltersen, PB
INFORMATION AND COMPUTATION, 2001, 171 (02) : 333 - 349
[50] Lower bounds for dynamic algebraic problems
Frandsen, GS
Hansen, JP
Miltersen, PB
STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 362 - 372

← 1 2 3 4 5 →