Computational complexity of term-equivalence

Thumbnail Image
File
1999_Bergman_ComputationalComplexityTermManuscript.pdf (169.22 KB)
Date
1999
Authors
Juedes, David
Slutzki, Giora
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

Two algebraic structures with the same universe are called term-equivalent if they have the same clone of term operations. We show that the problem of determining whether two finite algebras of finite similarity type are term-equivalent is complete for deterministic exponential time.

Series Number
Journal Issue
Is Version Of
Versions
Series
Academic or Administrative Unit
Type
article
Comments

This is a manuscript of an article published as Bergman, Clifford, David Juedes, and Giora Slutzki. "Computational complexity of term-equivalence." International Journal of Algebra and Computation 9, no. 01 (1999): 113-128. doi: 10.1142/S0218196799000084. Posted with permission.

Rights Statement
Copyright
Fri Jan 01 00:00:00 UTC 1999
Funding
DOI
Supplemental Resources
Collections