qp (258B)
1 # QP 2 3 https://en.wikipedia.org/wiki/Quasi-polynomial_time 4 5 [complexity_class] of [decision_problem] that can be solved in [quasipolynomial] time (2^{log n}^c}) 6 7 According to [wikipedia], good candidates for [np_intermediate] problems 8 9 Up: [complexity_class]