Complexity analysis of algorithms by recognition of their classification properties

DOI10.1007/BF01246515MaRDI QIDQ1816037zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• 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

Cited in

(2)

• Functions of binary trees and their applications in algorithm complexity analysis
• Computational complexity of problems in classification according to a relation matrix

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

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