A general definition of the O-notation for algorithm analysis

MaRDI QIDQ4967199zbMATH OpenFDO

Authors Kalle Rutanen, Germán Gómez-Herrero, Karen Egiazarian, Sirkka-Liisa Eriksson

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/373/354

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Minimal characterization of O-notation in algorithm analysis
• scientific article; zbMATH DE number 3965440
• scientific article; zbMATH DE number 3909741
• Why big-O and little-o in algorithm complexity: a pedagogical remark
• A decision procedure for linear ``big O equations

Cited in

(5)

• A new asymptotic notation: Weak Theta
• Minimal characterization of O-notation in algorithm analysis
• Why big-O and little-o in algorithm complexity: a pedagogical remark
• scientific article; zbMATH DE number 3909741 (Why is no real title available?)
• scientific article; zbMATH DE number 3965440 (Why is no real title available?)

This page was built for publication: A general definition of the \(O\)-notation for algorithm analysis

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