Testing membership: Beyond permutation groups

DOI10.1007/BFB0029001MaRDI QIDQ5096172zbMATH OpenOpenAlexFDO

Authors Martin Beaudry, Pierre McKenzie, Denis Thérien

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0029001

zbMATH Keywords

abelian monoidsfinite monoidsmembership problemidempotent semigroups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)

Cites work

• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 4068272 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• A taxonomy of problems with fast parallel algorithms
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• All Varieties of Bands I
• All varieties of bands
• Complete problems for deterministic polynomial time
• Complexity of some problems from the theory of automata
• The Parallel Complexity of Abelian Permutation Group Problems
• The complexity of theorem-proving procedures
• The lattice of equational classes of idempotent semigroups

Cited in

(1)

• Characterization of idempotent transformation monoids

This page was built for publication: Testing membership: Beyond permutation groups

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