scientific article; zbMATH DE number 5364247

MaRDI QIDQ3535343zbMATH OpenFDO

Authors M. V. Ulyanov

Publication date 10 November 2008

zbMATH Keywords

analysis of algorithmscomputational complexitycomputer algorithmsoptimization algorithmsresource-effectiveness

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 108385
• scientific article; zbMATH DE number 218386
• scientific article; zbMATH DE number 4080902
• scientific article; zbMATH DE number 544186
• scientific article; zbMATH DE number 873409
• A method for estimating resources required for implementation of finite algorithms
• On the efficiency of algorithms of analysis
• Algorithms. Design and analysis
• Algorithms. Design and analysis

Cited in

(2)

• Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
• Algorithms. Design techniques and analysis

This page was built for publication:

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