Minimal characterization of O-notation in algorithm analysis

DOI10.1016/J.TCS.2017.12.026MaRDI QIDQ1694676zbMATH OpenOpenAlexFDO

Authors Kalle Rutanen

Publication date 6 February 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.12.026

zbMATH Keywords

minimalcharacterizationO-notation

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

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

Cites work

• A general definition of the \(O\)-notation for algorithm analysis

Cited in

(3)

• Why big-\(O\) and little-\(o\) in algorithm complexity: a pedagogical remark
• scientific article; zbMATH DE number 3965440 (Why is no real title available?)
• A general definition of the \(O\)-notation for algorithm analysis

This page was built for publication: Minimal characterization of O-notation in algorithm analysis

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