## Abstract

We provide an extensive list of desirable properties for an O-notation —

as used in algorithm analysis — and reduce them to 8 primitive properties.

We prove that the primitive properties are equivalent to the definition of the

O-notation as linear dominance.

as used in algorithm analysis — and reduce them to 8 primitive properties.

We prove that the primitive properties are equivalent to the definition of the

O-notation as linear dominance.

Original language | English |
---|---|

Number of pages | 33 |

Journal | Bulletin of EATCS |

Issue number | 117 |

Publication status | Published - 21 Oct 2015 |

Publication type | A1 Journal article-refereed |

## Keywords

- O-notation
- algorithm analysis
- Complexity analysis

## Publication forum classification

- No publication forum level