The bounded and precise word problems for presentations of groups / / S.V. Ivanov.

"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
Superior document:Memoirs of the American Mathematical Society, number 1281
VerfasserIn:
Place / Publishing House:Providence, RI : : American Mathematical Society,, 2020.
Year of Publication:2020
Language:English
Series:Memoirs of the American Mathematical Society ; number 1281.
Online Access:
Physical Description:1 online resource (118 pages).
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items