On Lower Bounds for Algebraic Decision Trees over the Complex Numbers

被引：0
|
作者：
Scheiblechner, Peter [1 ]
机构：
[1] Purdue Univ, Dept Math, W Lafayette, IN 47907 USA
来源：
12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010) | 2011年
关键词：
lower bounds; algebraic decision trees;
D O I：
10.1109/SYNASC.2010.73
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove a new lower bound for the decision complexity of a complex algebraic set in terms of the sum of its (compactly supported) Betti numbers, which is for the first time better than logarithmic. We apply this result to subspace arrangements including some well studied problems such as the knapsack and element distinctness problems.
引用
收藏
页码：362 / 365
页数：4
相关论文
共 50 条
12345