An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences

DOI10.1007/BF01131844zbMath0875.68548OpenAlexW1998852705MaRDI QIDQ1816324

G. P. Kozhevnikova, S. O. Oleshko

Publication date: 20 January 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01131844

zbMATH Keywords

recursive algorithmscomplexity analysis of algorithmscomplexity recurrences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Computer-assisted microanalysis of programs
• Evaluation of Arithmetic Expressions with Algebraic Identities
• Mechanical program analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences