A General Definition of the O-notation for Algorithm Analysis
Research output: Contribution to journal › Article › Scientific › peer-review
|Number of pages||33|
|Journal||Bulletin of EATCS|
|Publication status||Published - 21 Oct 2015|
|Publication type||A1 Journal article-refereed|
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.