Complexity analysis of algorithms by recognition of their classification properties

DOI10.1007/BF01246515zbMath0875.68757OpenAlexW2050255214MaRDI QIDQ1816037

A. B. Vinokur, G. P. Kozhevnikova

Publication date: 18 December 1996

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

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

zbMATH Keywords

classificationpattern recognitioncomplexity analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (1)

Functions of binary trees and their applications in algorithm complexity analysis

Cites Work

• Formalized complexity analysis based on a priori investigation of the properties of algorithms and data structures
• Functions of binary trees and their applications in algorithm complexity analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of algorithms by recognition of their classification properties