[brudgers]

Since we call cases where something that looks polynomial on the surface but actually performs in NP "pseudo-polynomial," does it makes sense to call the cases where something more or less takes constant time "pseudo-logarithmic?"

[robrenaud]

Well, there are terms linearithmic and quasilinear that already get some usage.

> https://en.wikipedia.org/wiki/Time_complexity#Quasilinear_ti...

[Cushman]

Or maybe, since O(1) is in O(log n), you can cover your bases by just calling everything logarithmic regardless :)