scientific article; zbMATH DE number 2077108
From MaRDI portal
Publication:4470490
zbMATH Open1044.68679MaRDI QIDQ4470490FDOQ4470490
Authors: Hervé Caussinus, François Lemieux 
Publication date: 1 July 2004
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70)
Cited In (9)
- Algorithms for checking some properties of \(n\)-quasigroups
- Circuits and expressions with nonassociative gates
- Space Complexity of Reachability Testing in Labelled Graphs
- Finite loops recognize exactly the regular open languages
- Nondeterministics circuits, space complexity and quasigroups
- Conservative groupoids recognize only regular languages
- Computer Search for Large Sets of Idempotent Quasigroups
- Languages recognized by finite aperiodic groupoids
- Space complexity of reachability testing in labelled graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470490)
