Do languages decidable in deterministic $n^{O(\log n)}$ time form an interesting complexity class? If yes, is there a name for this class and are there some interesting properties about it that we know about? If not, why not (can we derive it properties easily from some other known complexity class)?Thank you!
Is $\mathsf{DTIME}(n^{O(\log n)})$ an interesting complexity class?
complexity classes