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...
Hlavní autor: | Linton, M |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
Elsevier
2023
|
Podobné jednotky
-
Generalized Heptagonal Membership Function for Fully Fuzzy Linear Fractional Programming Problems
Autor: Israa Hadi, a další
Vydáno: (2025-01-01) -
The Relationship Between Employees’ Intra-group Identities and Their Contribution to Small Group Activities: The Role of Subgroup Membership/Non-membership
Autor: Андрей Сидоренков, a další
Vydáno: (2019-06-01) -
On uniformly fully inert subgroups of abelian groups
Autor: Dardano Ulderico, a další
Vydáno: (2020-03-01) -
The Membership Problem for hypergeometric sequences with quadratic parameters
Autor: Kenison, G, a další
Vydáno: (2023) -
The membership problem for hypergeometric sequences with rational parameters
Autor: Nosan, K, a další
Vydáno: (2022)