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

DOI10.1016/0020-0190(88)90154-8MaRDI QIDQ1096401zbMATH OpenOpenAlexFDO

Authors 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

algebraic decision treecomputational geometryconvex hulllower boundmaximal vector

Mathematics Subject Classification ID

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

Cites work

• A Lower Bound to Finding Convex Hulls
• Comments on a lower bound for convex hull determination
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3223507 (Why is no real title available?)
• Linear decision trees are too weak for convex hull problem
• Lower bounds for algebraic decision trees
• On the (n n) lower bound for convex hull and maximal vector determination
• On the Betti Numbers of Real Varieties
• The Ultimate Planar Convex Hull Algorithm?

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096401)