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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Glavni avtor: Ivanov, S. V. (Sergei V.) (Author)
Format: Elektronski eKnjiga
Jezik:angleščina
Izdano: Providence, RI : American Mathematical Society, 2020.
Serija:Memoirs of the American Mathematical Society ; number 1281.
Teme:
Online dostop:Click to View
Oznake: Označite
Brez oznak, prvi označite!