On the complexity of functions for random access machines

DOI10.1145/151261.151262zbMath0770.68065OpenAlexW2066806665MaRDI QIDQ5286161

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)

Related Items (1)

When can we sort in \(o(n\log n)\) time?

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