Linear decision trees are too weak for convex hull problem
References (7)
- et al.
On the complexity of computations under varying sets of primitives
J. Comput. System Sci.
(1979) An efficient algorithm for determining the convex hull of a finite planar set
Information Processing Lett.
(1972)- et al.
The Design and Analysis of Computer Algorithms
(1976)
There are more references available in the full text version of this article.
Cited by (5)
A variant of Ben-or's lower bound for algebraic decision trees
1988, Information Processing LettersA Bibliography on Digital and Computational Convexity (1961-1988)
1989, IEEE Transactions on Pattern Analysis and Machine IntelligenceOn the inherent combinatorial complexity of geometric problems in d - dimensional space
1986, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Linear comparison complexity of the n-cube membership problem
1985, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)New lower bound for polyhedral membership problem with an application to linear programming
1984, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1981 Published by Elsevier B.V.