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...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2020
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2763799 |