I am writing a paper in which I want to refer to a group of algorithms. Some of these algorithms are of complexity `O(NlogN)`, and some of the are more complex (e.g polynomial-time) and I want to refer to them all in one term. Is there any common term to use in such a situation?

`linearithmic` refers to `O(NLOGN)` algorithms and it's narrower than what I'm looking for. I don't think of `non-linear` as a good term to use here. If it is, then correct me please.

my sentence:

> 
> In such a setting, state-of-the-art community-detection algorithms does not scale well. To reduce the running time of these XYZ algorithms, each sub-graph is partitioned into chunks.
> 
> 
> 

I want to change `XYZ' in the above, to what I am asking for.