Abstract | ||
---|---|---|
We provide an extensive list of desirable properties for an O-notationas 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. |
Year | Venue | Field |
---|---|---|
2015 | BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | Discrete mathematics,Big O notation,Algorithm,Mathematics |
DocType | Volume | Issue |
Journal | 117 | 117 |
ISSN | Citations | PageRank |
0252-9742 | 1 | 0.63 |
References | Authors | |
2 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kalle Rutanen | 1 | 17 | 4.07 |
Germán Gómez-Herrero | 2 | 35 | 5.94 |
Sirkka-Liisa Eriksson | 3 | 2 | 1.33 |
Karen O. Egiazarian | 4 | 529 | 54.95 |