scientific article; zbMATH DE number 19781

MaRDI QIDQ3979281zbMATH OpenFDO

Authors K. Unger

Publication date 26 June 1992

zbMATH Keywords

lower boundsconvex hullalgebraic decision trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Lower bounds on testing membership to a polyhedron by algebraic decision trees
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
• scientific article; zbMATH DE number 3997167
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

Cited in

(4)

• scientific article; zbMATH DE number 3945384 (Why is no real title available?)
• Lower bounds on testing membership to a polyhedron by algebraic decision trees
• scientific article; zbMATH DE number 1256781 (Why is no real title available?)
• scientific article; zbMATH DE number 3997167 (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 Q3979281)