Cargando…

The bounded and precise word problems for presentations of groups /

The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Ivanov, Sergeĭ, 1972- (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Providence, RI : American Mathematical Society, [2020]
Colección:Memoirs of the American Mathematical Society ; no. 1281.
Temas:
Acceso en línea:Texto completo

Ejemplares similares