COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE-Reference-Cited by-同舟云学术

COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE

Published:1999-02 Issue:01 Volume:09 Page:113-128
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

BERGMAN CLIFFORD¹,JUEDES DAVID²,SLUTZKI GIORA³

Affiliation:

1. Department of Mathematics, Iowa State University, Ames, Iowa 50011, USA

2. School of Electrical Engineering and Computer Science, Ohio University, Athens, Ohio 45701, Greece

3. Department of Computer Science, Iowa State University, Ames, Iowa 50011, USA

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196799000084

Reference6 articles.

1. Oracle branching programs and Logspace versus P

2. Alternation

3. On the computational complexity of algorithms

4. Complete problems for deterministic polynomial time

5. New problems complete for nondeterministic log space

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Complexity of the Clone Membership Problem;Theory of Computing Systems;2021-01-20

2. On the complexity of the Leibniz hierarchy;Annals of Pure and Applied Logic;2019-07

3. Complexity of term representations of finitary functions;International Journal of Algebra and Computation;2018-09

4. Testing for a Semilattice Term;Order;2018-03-14

5. Algebras and Algorithms;2015 IEEE International Symposium on Multiple-Valued Logic;2015-05