Tampere University of Technology

TUTCRIS Research Portal

Minimal Characterization of O-notation in Algorithm Analysis

Research output: Contribution to journalArticle

Details

Original languageEnglish
Pages (from-to)31-41
JournalTheoretical Computer Science
Volume713
Early online date27 Dec 2017
DOIs
StatePublished - Feb 2018
Publication typeA1 Journal article-refereed

Abstract

Previously, we showed that linear dominance is the only definition of O-notation suitable for algorithm analysis [1,2]. Linear dominance was characterized by 8 primitive properties as a down-set of a non-trivial scale-invariant preorder which is preserved under certain modifications to algorithms and is consistent with pointwise partial order. In this paper, we provide a minimal characterization of O-notation, where there are no redundant properties. Such is given by excluding locality from primitive properties.

Keywords

  • O-notation, characterization, minimal

Publication forum classification

Field of science, Statistics Finland