On the complexity of functions for random access machines

DOI10.1145/151261.151262zbMATH Open0770.68065OpenAlexW2066806665MaRDI QIDQ5286161FDOQ5286161

Authors: Nader H. Bshouty 

Publication date: 29 June 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/151261.151262

Recommendations

• Lower bounds on algebraic random access machines
• Topological lower bounds on algebraic random access machines
• Upper bounds for sorting integers on random access machines
• scientific article; zbMATH DE number 3850476

zbMATH Keywords

sortinggreatest common divisorrandom access machineindirect addressing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• Title not available (Why is that?)
• Denseness of volatile and nonvolatile sequences of functions
• On the complexity of finite random functions
• Title not available (Why is that?)
• Combined hierarchies of finite random access machines
• Title not available (Why is that?)
• When can we sort in \(o(n\log n)\) time?
• Lower bounds on algebraic random access machines

This page was built for publication: On the complexity of functions for random access machines

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