On parameterized complexity of the word search problem in the Baumslag-Gersten group

DOI10.1145/3373207.3404042OpenAlexW3046140887WikidataQ130991637 ScholiaQ130991637MaRDI QIDQ5145996

No author found.

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373207.3404042

zbMATH Keywords

word problemfixed parameter tractabilityparameterized complexityBaumslag-Solitar groupDehn functionBaumslag-Gersten groupword search problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Parallel algorithms for power circuits and the word problem of the Baumslag group

This page was built for publication: On parameterized complexity of the word search problem in the Baumslag-Gersten group