A variant of Ben-or's lower bound for algebraic decision trees
- 11 January 1988
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (5) , 273-276
- https://doi.org/10.1016/0020-0190(88)90154-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- Linear decision trees are too weak for convex hull problemInformation Processing Letters, 1981
- Comments on a lower bound for convex hull determinationInformation Processing Letters, 1980
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- On the Betti numbers of real varietiesProceedings of the American Mathematical Society, 1964