Lower bounds for external algebraic decision trees

MaRDI QIDQ2921737zbMATH OpenFDO

Authors Jeff Erickson

Publication date 13 October 2014

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(7)

• Lower bounds on probabilistic linear decision trees
• Lower bounds for processing data with few random accesses to external memory
• scientific article; zbMATH DE number 1256781 (Why is no real title available?)
• scientific article; zbMATH DE number 1424315 (Why is no real title available?)
• Lower bounds for external memory integer sorting via network coding
• Lower bounds for external memory integer sorting via network coding
• An (n n) lower bound for computing the sum of even-ranked elements

This page was built for publication: Lower bounds for external algebraic decision trees

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