The fully compressed subgroup membership problem
Suppose that F is a free group and k is a natural number. We show that the fully compressed membership problem for k-generated subgroups of F is solvable in polynomial time. In order to do this, we adapt the theory of Stallings' foldings to handle edges with compressed labels. This partially an...
Autor principal: | Linton, M |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
Elsevier
2023
|
Ítems similars
-
Generalized Heptagonal Membership Function for Fully Fuzzy Linear Fractional Programming Problems
per: Israa Hadi, et al.
Publicat: (2025-01-01) -
The Relationship Between Employees’ Intra-group Identities and Their Contribution to Small Group Activities: The Role of Subgroup Membership/Non-membership
per: Андрей Сидоренков, et al.
Publicat: (2019-06-01) -
On uniformly fully inert subgroups of abelian groups
per: Dardano Ulderico, et al.
Publicat: (2020-03-01) -
The Membership Problem for hypergeometric sequences with quadratic parameters
per: Kenison, G, et al.
Publicat: (2023) -
The membership problem for hypergeometric sequences with rational parameters
per: Nosan, K, et al.
Publicat: (2022)