Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
asymptotic notation
|
| gptkbp:category |
gptkb:mathematical_concept
|
| gptkbp:contrastsWith |
growth rates of functions
|
| gptkbp:describes |
asymptotic tight bound
|
| gptkbp:formalDefinition |
f(n) = Θ(g(n)) if there exist positive constants c1, c2, n0 such that 0 ≤ c1·g(n) ≤ f(n) ≤ c2·g(n) for all n ≥ n0
|
| https://www.w3.org/2000/01/rdf-schema#label |
Big Theta notation
|
| gptkbp:introduced |
gptkb:Donald_Knuth
|
| gptkbp:relatedTo |
gptkb:Big_O_notation
Big Omega notation |
| gptkbp:symbol |
Θ
|
| gptkbp:usedFor |
algorithm analysis
|
| gptkbp:usedIn |
gptkb:mathematics
computer science |
| gptkbp:bfsParent |
gptkb:Landau_notation_(Big_O_notation)
|
| gptkbp:bfsLayer |
6
|