scientific article; zbMATH DE number 3988710

zbMATH Open0611.68022MaRDI QIDQ3751008FDOQ3751008

Authors: Martin Dietzfelbinger, Wolfgang Maass 

Publication date: 1986

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

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

zbMATH Keywords

random access machineslinear decision trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• A lower bound for the integer element distinctness problem
• Lower bound arguments with ``inaccessible numbers
• There's No Forcing a Least Upper Bound
• 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)