scientific article; zbMATH DE number 3988710

MaRDI QIDQ3751008zbMATH OpenFDO

Authors Martin Dietzfelbinger, Wolfgang Maass

Publication date 1986

zbMATH Keywords

linear decision treesrandom access machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Lower bound arguments with ``inaccessible numbers
• On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines
• Lower bounds on algebraic random access machines
• Topological lower bounds on algebraic random access machines
• Publication:4886070

Cited in

(5)

• Lower bound arguments with ``inaccessible numbers
• A lower bound for the integer element distinctness problem
• There's No Forcing a Least Upper Bound
• scientific article; zbMATH DE number 1351079 (Why is no real title available?)
• On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines

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 Q3751008)