Computing congruences efficiently

• Autores: Ralph Freese
• Localización: Algebra universalis, ISSN 0002-5240, Vol. 59, Nº. 3-4, 2008, págs. 337-343
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • For a fixed similarity type which is at least binary, we show there is a linear time algorithm for computing the principal congruence generated by a pair of elements.