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.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: