Pages that link to "Item:Q1060232"
From MaRDI portal
The following pages link to Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra (Q1060232):
Displaying 14 items.
- Subquandles of affine quandles (Q724276) (← links)
- Computing congruences efficiently (Q1001460) (← links)
- Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes (Q1010738) (← links)
- An algebraic theory of functional and multivalued dependencies in relational databases (Q1096380) (← links)
- Effective subdirect decomposition: A case study (Q1193629) (← links)
- On the disjunctive set problem (Q1275463) (← links)
- Algorithm to compute abelian subalgebras and ideals in Malcev algebras (Q2831034) (← links)
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES (Q3043639) (← links)
- (Q3940851) (← links)
- (Q3946212) (← links)
- Congruence lattices of algebras— the signed labelling (Q4875599) (← links)
- Computational complexity of some problems involving congruences on algebras (Q5958321) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- Computing generating sets of minimal size in finite algebras (Q6108373) (← links)