The fully compressed subgroup membership problem
From MaRDI portal
Publication:6038521
DOI10.1016/j.jalgebra.2023.03.026arXiv2110.10055OpenAlexW3206692255MaRDI QIDQ6038521
Publication date: 2 May 2023
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.10055
Theory of computing (68Qxx) Special aspects of infinite or finite groups (20Fxx) Structure and classification of infinite or finite groups (20Exx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
- The Nielsen reduction and P-complete problems in free groups
- The submonoid and rational subset membership problems for graph groups.
- Polynomial-time word problems.
- Topology of finite graphs
- Stallings foldings and subgroups of free groups
- Compression techniques in group theory
- The complexity of compressed membership problems for finite automata
- Algorithmics on SLP-compressed strings: A survey
- Processing Compressed Texts: A Tractability Border
- Efficient algorithms for Lempel-Ziv encoding
- Membership Problem for the Modular Group
This page was built for publication: The fully compressed subgroup membership problem
