The complexity of computing over quasigroups

DOI10.1007/3-540-58715-2_112MaRDI QIDQ4470490zbMATH OpenFDO

Authors Hervé Caussinus, François Lemieux

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58715-2_112

zbMATH Keywords

formal languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70)

Recommendations

• Quotient structures and groups computable in polynomial time
• The complexity of checking the polynomial completeness of finite quasigroups
• scientific article; zbMATH DE number 1534404
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
• Computability of finite quotients of finitely generated groups
• scientific article; zbMATH DE number 919272
• scientific article; zbMATH DE number 56705
• On the computational complexity of the theory of Abelian groups
• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• On the complexity of quasivariety lattices

Cited in

(9)

• Languages recognized by finite aperiodic groupoids
• Nondeterministics circuits, space complexity and quasigroups
• Circuits and expressions with nonassociative gates
• Algorithms for checking some properties of \(n\)-quasigroups
• Space complexity of reachability testing in labelled graphs
• Computer Search for Large Sets of Idempotent Quasigroups
• Finite loops recognize exactly the regular open languages
• Conservative groupoids recognize only regular languages
• Space Complexity of Reachability Testing in Labelled Graphs

This page was built for publication: The complexity of computing over quasigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470490)