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?"
> https://en.wikipedia.org/wiki/Time_complexity#Quasilinear_ti...