Complexity of computer algorithms

DOI10.1216/RMJ-1987-17-1-167MaRDI QIDQ1104750zbMATH OpenOpenAlexFDO

Authors Ronald J. Leach

Publication date 1987

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1216/rmj-1987-17-1-167

zbMATH Keywords

arithmetic algorithmscomplexity of computationsorting algorithms

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Polynomial estimation of the complexity of algorithms
• scientific article; zbMATH DE number 4141415
• scientific article; zbMATH DE number 4016186
• scientific article; zbMATH DE number 4039250
• Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics

Cited in

(3)

• scientific article; zbMATH DE number 4019037 (Why is no real title available?)
• scientific article; zbMATH DE number 6026956 (Why is no real title available?)
• scientific article; zbMATH DE number 5497651 (Why is no real title available?)

This page was built for publication: Complexity of computer algorithms

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