A variant of Ben-Or's lower bound for algebraic decision trees
type: Item
instance of: scholarly article
title: A variant of Ben-Or's lower bound for algebraic decision trees
zbMATH Open document ID: 0633.68078
DOI: 10.1016/0020-0190(88)90154-8
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/1802/5666
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68U99
zbMATH DE Number: 4031023
zbMATH Keywords: lower bound
zbMATH Keywords: algebraic decision tree
zbMATH Keywords: computational geometry
zbMATH Keywords: convex hull
zbMATH Keywords: maximal vector
author: Joel I. Seiferas
MaRDI profile type: Publication
OpenAlex ID: W2022009440
cites work: Comments on a lower bound for convex hull determination
cites work: Linear decision trees are too weak for convex hull problem
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: On the Betti Numbers of Real Varieties
cites work: Q3992847
cites work: Lower bounds for algebraic decision trees
cites work: Q5511997
cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
cites work: A Lower Bound to Finding Convex Hulls
description: scientific article; zbMATH DE number 4031023