Membership testing in commutative transformation semigroups
From MaRDI portal
Publication:1108790
DOI10.1016/0890-5401(88)90018-1zbMath0654.68043MaRDI QIDQ1108790
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90018-1
68Q25: Analysis of algorithms and problem complexity
20M20: Semigroups of transformations, relations, partitions, etc.
Related Items
Unnamed Item, Synchronizing words and monoid factorization, yielding a new parameterized complexity class?, The Intersection Problem for Finite Semigroups, The complexity of intersecting finite automata having few final states, Computing finite semigroups, The intersection problem for finite monoids
Cites Work
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Parallel algorithms for solvable permutation groups
- A taxonomy of problems with fast parallel algorithms
- The Parallel Complexity of Abelian Permutation Group Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item