DocumentCode
2221813
Title
Computational complexity of some problems involving congruences on algebras
Author
Bergman, Clifford ; Slutzki, Giora
Author_Institution
Dept. of Math., Iowa State Univ., Ames, IA, USA
fYear
2000
fDate
2000
Firstpage
168
Lastpage
174
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
Keywords
algebra; computational complexity; set theory; algebras; computational complexity; congruences; nondeterministic log-space; nondeterministic polynomial time; smallest fully invariant congruence; subdirectly irreducible algebra; Algebra; Computational complexity; Computer science; Equations; Image converters; Mathematics; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
Conference_Location
Santa Barbara, CA
ISSN
1043-6871
Print_ISBN
0-7695-0725-5
Type
conf
DOI
10.1109/LICS.2000.855765
Filename
855765
Link To Document