Campus Units

Computer Science, Mathematics

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

1999

Journal or Book Title

International Journal of Algebra and Computation

Volume

9

Issue

1

First Page

113

Last Page

128

DOI

10.1142/S0218196799000084

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.

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.

Copyright Owner

World Scientific Publishing Company

Language

en

File Format

application/pdf

Published Version

Share

COinS