Pages that link to "Item:Q6108373"

The following pages link to Computing generating sets of minimal size in finite algebras (Q6108373):

Displaying 8 items.

• On the smallest number of generators and the probability of generating an algebra (Q442423) (← links)
• On generating sets of finite algebras (Q895876) (← links)
• Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes (Q1010738) (← links)
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra (Q1060232) (← links)
• The size of generating sets of powers (Q2318479) (← links)
• Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields (Q2985839) (← links)
• The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)
• Small Generating Sets and DLPC Problem (Q4976409) (← links)