scientific article; zbMATH DE number 3997167

MaRDI QIDQ4723301zbMATH OpenFDO

Authors

Publication date 1986

zbMATH Keywords

algebraic decision algorithmscomputational geometrynontrivial lower boundsplane geometryworst-case time complexity

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 19781
• A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem
• New lower bounds for Hopcroft's problem
• scientific article; zbMATH DE number 4114000
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

Cited in

(2)

• scientific article; zbMATH DE number 19781 (Why is no real title available?)
• scientific article; zbMATH DE number 5592483 (Why is no real title available?)

This page was built for publication:

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