Is there any efficient algorithm for computing all semigroups of order n? Is there any efficient algorithm for computing all semigroups of order n?

I found the following paper which solves a bit different problem.


Veronique Froidure and Jean-Eric Pin, "Algorithms for computing finite semigroups"
You asked the same question here
and I answered it. Jean-Eric's algorithm is for computing the elements (among other things) of a semigroup defined by a generating set, and is not related to your question.