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

Full description

Saved in:
Bibliographic Details
Main Author: Ivanov, S. V. (Sergei V.) (Author)
Format: Electronic eBook
Language:English
Published: Providence, RI : American Mathematical Society, 2020.
Series:Memoirs of the American Mathematical Society ; number 1281.
Subjects:
Online Access:Click to View
Tags: Add Tag
No Tags, Be the first to tag this record!