Computing generating sets of minimal size in finite algebras

DOI10.1016/j.jsc.2023.02.002zbMath1520.20128MaRDI QIDQ6108373

Mikoláš Janota, Petr Vojtěchovský, Antonio Morgado

Publication date: 29 June 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

generatorsrankinteger linear programmingMoufang loopscomputational algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Loops, quasigroups (20N05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational methods for problems pertaining to group theory (20-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the query complexity of selecting minimal sets for monotone predicates
• The largest size of a minimal generating set of a finite group.
• Computing a set of generators of minimal cardinality in a solvable group
• On limited nondeterminism and the complexity of the V-C dimension
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• The Moufang loops of order 64 and 81.
• On loops of odd order. II
• Nilpotence of finite Moufang 2-loops
• Counterexample-guided abstraction refinement for symbolic model checking
• PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
• The octonions
• The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
• Lagrange's theorem for Moufang loops
• Exploiting the Power of mip Solvers in maxsat
• Quantified Maximum Satisfiability:
• Minimal generating sets of groups, rings, and fields
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

This page was built for publication: Computing generating sets of minimal size in finite algebras