Complexity of computer algorithms

DOI10.1216/RMJ-1987-17-1-167zbMATH Open0647.68047OpenAlexW2095339274MaRDI QIDQ1104750FDOQ1104750

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

Recommendations

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

zbMATH Keywords

complexity of computationsorting algorithmsarithmetic algorithms

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)