News for hackers. Stuff that matters.
Re:Calculating integer factorials in constant time, taking a... by tantalor on Tuesday December 15, 2015 @03:24PM (#10740228)
No, I don't think so. O(1) is "constant" time. See https://en.wikipedia.org/wiki/Time_complexity
Re:Calculating integer factorials in constant time, taking a... by Dylan16807 on Tuesday December 15, 2015 @04:11PM (#10740502)
O(1) is a constant time bound. But when people talk about constant time they often mean literally constant, such as to avoid timing attacks.
Re:Calculating integer factorials in constant time, taking a... by dragonwriter on Tuesday December 15, 2015 @04:24PM (#10740597)
Its true that constant time is sometimes used in that way, though in discussions of computation complexity, "constant time" usually means O(1).

There narrower use is more like Θ(1) with the upper and lower constants identical.