Skip to main content
SpringerLink
Log in

Computing congruences efficiently

  • Published:
Algebra universalis Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Hawaii, Honolulu, Hawaii, 96822, USA

    Ralph Freese

Authors
  1. Ralph Freese
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ralph Freese.

Additional information

Dedicated to George Grätzer and E. Tamás Schmidt on their 70th birthdays

Received November 25, 2006; accepted in final form May 8, 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Freese, R. Computing congruences efficiently. Algebra univers. 59, 337–343 (2008). https://doi.org/10.1007/s00012-008-2073-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00012-008-2073-1

Keywords and phrases:

2000 Mathematics Subject Classification:

Search

Navigation