A variant of Ben-Or's lower bound for algebraic decision trees

DOI10.1016/0020-0190(88)90154-8zbMath0633.68078OpenAlexW2022009440MaRDI QIDQ1096401

Joel I. Seiferas

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1802/5666

zbMATH Keywords

convex hulllower boundcomputational geometryalgebraic decision treemaximal vector

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Artificial intelligence (68T99)

Related Items (2)

An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains ⋮ A comment on a minmax location problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
• Comments on a lower bound for convex hull determination
• Linear decision trees are too weak for convex hull problem
• The Ultimate Planar Convex Hull Algorithm?
• A Lower Bound to Finding Convex Hulls
• Lower bounds for algebraic decision trees
• On the Betti Numbers of Real Varieties

This page was built for publication: A variant of Ben-Or's lower bound for algebraic decision trees