scientific article; zbMATH DE number 19781

zbMATH Open0735.68044MaRDI QIDQ3979281FDOQ3979281

Authors: K. Unger 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

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)

Cited In (4)

• Title not available (Why is that?)
• Lower bounds on testing membership to a polyhedron by algebraic decision trees
• Title not available (Why is that?)
• Title not available (Why is that?)

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)