The Word Problem in the Baumslag Group with a Non-Elementary Dehn Function Is Polynomial Time Decidable

Alexei Miasnikov, A. U., & Won, D. W. (2011). The Word Problem in the Baumslag Group with a Non-Elementary Dehn Function Is Polynomial Time Decidable. Journal of Algebra.

Type

Preprint

Intellectual base

Grey literature

Year

2011

Link

https://arxiv.org/abs/1102.2481

Cited by

1 citation across 1 artifact.

Domain-specific

• Baumslag–Gersten Group
  • Miasnikov, Ushakov, and Won gave a polynomial-time word-problem algorithm using compressed representations and controlled transformations rather than fully expanding the hidden powers.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1633b19bbbb1 · see in the full table