Katalog GES



THE WORD AND GEODESIC PROBLEMS IN FREE SOLVABLE GROUPS

We study the computational complexity of the Word Problem (WP) in free solvable groups S r,d , where r ≥ 2 is the rank and d ≥ 2 is the solvability class of the group. It is known that the Magnus embedding of S r,d into matrices provides a polynomial time decision algorithm for WP in a fixed... Full description

1st Person: MYASNIKOV, A.
Additional Persons: ROMAN'KOV, V. verfasserin; USHAKOV, A. verfasserin; VERSHIK, A. verfasserin
Source: in Transactions of the American Mathematical Society Vol. 362, No. 9 (2010), p. 4655-4682
More Articles
Type of Publication: Article
Language: English
Published: 2010
Keywords: research-article
Online: Volltext
  Search for full text

Online

Volltext

Similar Items

Cannot find similar records

Library Services

Search Options

Quick links

Orientation