Name for a class of problems solvable in $n^{O(\log \log n)}$

Isomorphism testing of projective planes can be done in $n^{O(\log \log n)}$. This class is contained in quasi-polynomial time. I would like to know more about this class and natural problems in it.

Is there a standard name for this class of problems?

Also, I am looking for a reference (or survey) that gives other natural problems (without known polynomial-time algorithms) in this class.

• You mentioned sub-exponential time but not quasi-polynomial time, so I figured I'd mention the latter. ​ ​ – user12859 May 19 '16 at 12:44
• @RickyDemer Yes. I will edit it. – Mohammad Al-Turkistany May 19 '16 at 12:45