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 条

[1] LOWER BOUNDS FOR ALGEBRAIC DECISION TREES
STEELE, JM
YAO, AC
JOURNAL OF ALGORITHMS, 1982, 3 (01) : 1 - 8
[2] Lower Bounds for External Algebraic Decision Trees
Erickson, Jeff
PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 755 - 761
[3] On Lower Bounds for Algebraic Decision Trees over the Complex Numbers
Scheiblechner, Peter
12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010), 2011, : 362 - 365
[4] On Topological Lower Bounds for Algebraic Computation Trees
Andrei Gabrielov
Nicolai Vorobjov
Foundations of Computational Mathematics, 2017, 17 : 61 - 72
[5] On Topological Lower Bounds for Algebraic Computation Trees
Gabrielov, Andrei
Vorobjov, Nicolai
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2017, 17 (01) : 61 - 72
[6] On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
Ghosal, Purnata
Rao, B. V. Raghavendra
FUNDAMENTA INFORMATICAE, 2020, 177 (01) : 69 - 93
[7] On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
Ghosal, Purnata
Rao, B. V. Raghavendra
COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 178 - 192
[8] Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems
Sen, S
FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1994, 880 : 193 - 204
[9] Complexity lower bounds for approximation algebraic computation trees
Cucker, F
Grigoriev, D
JOURNAL OF COMPLEXITY, 1999, 15 (04) : 499 - 512
[10] LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES WITH INTEGER INPUTS
YAO, ACC
SIAM JOURNAL ON COMPUTING, 1991, 20 (04) : 655 - 668

← 1 2 3 4 5 →