It can be hard to determine the number of groups with order $n$, especially for $n=2^k$. So, I wonder, whether there is a polynomial algorithm doing this.
I think, this is not the case because for relatively small numbers $n$, the number of groups with order $n$ is not known.
Is it known whether this problem is $NP$-hard ?