Computing the Tame Congruece Theory Type of an Algebra

@inproceedings{Freese2014ComputingTT,
  title={Computing the Tame Congruece Theory Type of an Algebra},
  author={Ralph Freese and Joel Berman and Emese Kiss and P. Prőhle},
  year={2014}
}
In [1] J. Berman, E. Kiss, P. Prőhle and Á. Szendrei gave a polynomial time algorithm, here referred to as the BKPS algorithm, for computing typ(A), the set of tame congruence theory types that occur in a finite algebra A. The bound given by those authors in [1] for computing the type of a covering β α in Con (A) is (a constant times) ||A||, the fourth… CONTINUE READING