Comment verifier l'associativite d'une table de groupe

DOI10.1016/0304-3975(77)90057-3zbMath0361.20045OpenAlexW2033881024MaRDI QIDQ1239383

Jean E. Vuillemin

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90057-3

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) General structure theorems for groups (20E34) Generators, relations, and presentations of groups (20F05) Loops, quasigroups (20N05) Algorithms in computer science (68W99)

Related Items (2)

Complexity bounds for equivalence and isomorphism of latin squares ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Determining whether a groupoid is a group
• Condition for a Loop to be a Group
• Conditions for a Loop to be a Group and for a Groupoid to be a Semigroup

This page was built for publication: Comment verifier l'associativite d'une table de groupe