The bounded and precise word problems for presentations of groups /

"We introduce and study 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 the p...

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Principal: Ivanov, S. V. (Sergei V.) (Author)
Formato: Electrónico eBook
Idioma:inglés
Publicado: Providence, RI : American Mathematical Society, 2020.
Series:Memoirs of the American Mathematical Society ; number 1281.
Subjects:
Acceso en liña:Click to View
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!