On semigroups with PSPACE-complete subpower membership problem
Group Theory
2019-02-20 v1 Computational Complexity
Abstract
Fix a finite semigroup and let be tuples in a direct power . The subpower membership problem (SMP) for asks whether can be generated by . For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the -element Brandt monoid, the full transformation semigroup on or more letters, and semigroups of all by matrices over a field for .
Cite
@article{arxiv.1604.01757,
title = {On semigroups with PSPACE-complete subpower membership problem},
author = {Markus Steindl},
journal= {arXiv preprint arXiv:1604.01757},
year = {2019}
}