News for hackers. Stuff that matters.
Re:Application for Fixed Satellite Service by SpaceX by repsilat on Thursday November 08, 2018 @10:00PM (#18412045)
It's just an asymptotic upper bound (though often used to imply tight bounds).

It's most commonly applied to worst case running time, but is often applied to expected running time ("hash table insertions run in O(1)"), space complexity, communication overhead, numerical accuracy and any number of other metrics.

Re:Application for Fixed Satellite Service by SpaceX by loeg on Thursday November 08, 2018 @10:05PM (#18412062)
Yep. Often people mean the narrower big-theta when they express complexity in terms of big-O.