Minimal characterization of O-notation in algorithm analysis

DOI10.1016/J.TCS.2017.12.026zbMath1386.68238OpenAlexW2779392784MaRDI QIDQ1694676

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

characterizationminimalO-notation

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• Unnamed Item

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