Computational Complexity of Some Problems Involving Congruences on Algebras

Authors:
Clifford Bergman;Giora Slutzki
Affiliations:
-;-
Venue:
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Year:
2000

Citing 8
Cited 0

Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

Theoretical Computer Science
Languages that capture complexity classes

SIAM Journal on Computing
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras

SIAM Journal on Computing
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra generated by a set of pairs, and determining whether a given algebra is simple or subdirectly irreducible. We also consider the problem of determining the smallest fully invariant congruence on a given algebra containing a given set of pairs. We prove that this problem is complete for nondeterministic polynomial time.