On the complexity of functions for random access machines

DOI10.1145/151261.151262MaRDI QIDQ5286161zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

sortinggreatest common divisorrandom access machineindirect addressing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

Cited in

(8)

• scientific article; zbMATH DE number 1254029 (Why is no real title available?)
• Lower bounds on algebraic random access machines
• When can we sort in \(o(n\log n)\) time?
• Denseness of volatile and nonvolatile sequences of functions
• On the complexity of finite random functions
• scientific article; zbMATH DE number 6913819 (Why is no real title available?)
• Combined hierarchies of finite random access machines
• scientific article; zbMATH DE number 18636 (Why is no real title available?)

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)