Semigroup Enumeration
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Leandro Minku.
We describe the problem of enumerating semigroups of order n up to isomorphism and anti-isomorphism. We outline previous approaches, and the the approach we took to solve the problem for n=9. We describe our distributed-computation approach for solving for n=10 (which has a search space of 10^{100}) both in terms of the underlying algebraic structures, and in terms of practical cloud and grid computation.
This talk is part of the Artificial Intelligence and Natural Computation seminars series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|