On parameterized complexity of the word search problem in the Baumslag-Gersten group (Q5145996)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On parameterized complexity of the word search problem in the Baumslag-Gersten group |
scientific article; zbMATH DE number 7300092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parameterized complexity of the word search problem in the Baumslag-Gersten group |
scientific article; zbMATH DE number 7300092 |
Statements
On parameterized complexity of the word search problem in the Baumslag-Gersten group (English)
0 references
22 January 2021
0 references
Baumslag-Gersten group
0 references
Baumslag-Solitar group
0 references
Dehn function
0 references
fixed parameter tractability
0 references
parameterized complexity
0 references
word problem
0 references
word search problem
0 references
