A General Definition of the O-notation for Algorithm Analysis
Tutkimustuotos › › vertaisarvioitu
Yksityiskohdat
| Alkuperäiskieli | Englanti |
|---|---|
| Sivumäärä | 33 |
| Julkaisu | Bulletin of EATCS |
| Numero | 117 |
| Tila | Julkaistu - 21 lokakuuta 2015 |
| OKM-julkaisutyyppi | A1 Alkuperäisartikkeli |
Tiivistelmä
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.