A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Comments on a lower bound for convex hull determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear decision trees are too weak for convex hull problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank

Latest revision as of 13:52, 18 June 2024

scientific article
Language Label Description Also known as
English
A variant of Ben-Or's lower bound for algebraic decision trees
scientific article

    Statements

    A variant of Ben-Or's lower bound for algebraic decision trees (English)
    0 references
    1988
    0 references
    lower bound
    0 references
    algebraic decision tree
    0 references
    computational geometry
    0 references
    convex hull
    0 references
    maximal vector
    0 references
    0 references

    Identifiers