Improved lower bound on testing membership to a polyhedron by algebraic decision trees

Authors:
D. Grigoriev;M. Karpinski;N. Vorobjov
Affiliations:
-;-;-
Venue:
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Year:
1995

Citing 0
Cited 5

A lower bound for randomized algebraic decision trees

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized Ω(n2) lower bound for knapsack

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized complexity lower bounds

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Geometric Searching over the Rationals

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new method of proving lower bounds on the depth of algebraic decision trees of degree d and apply it to prove a lower bound /spl Omega/(log N) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N