On parameterized complexity of the word search problem in the Baumslag-Gersten group
From MaRDI portal
Publication:5145996
Recommendations
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- The Bounded and Precise Word Problems for Presentations of Groups
- The complexity of Dehn's algorithm for word problems in groups
- Parallel algorithms for power circuits and the word problem of the Baumslag group
Cited in
(2)
This page was built for publication: On parameterized complexity of the word search problem in the Baumslag-Gersten group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145996)