Clifford Bergman - Complexity of some problems in universal algebra

Given two finite algebras A and B, there are several natural questions one might ask about the relationship between A and B. Among them: Do A and B generate the same (quasi)variety? And, are A and B term-equivalent? Although these problems are well-known to be decidable, the precise computational complexity seems to be nontrivial.

In this talk, we will survey some old and new results on these questions, as well as pose some open problems.

This is joint work with Giora Slutzki (Iowa State University).