The length of elements in free solvable groups-Reference-Cited by-同舟云学术

The length of elements in free solvable groups

Published:1993 Issue:1 Volume:119 Page:27-33
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Droms Carl,Lewin Jacques,Servatius Herman

Abstract

We examine the relationship between the complexity of the word problem for a presentation and the complexity of the problem of determining the length of a shortest word equivalent to a given word. Our main result is that the length of the element represented by a word in a free solvable group can be determined in polynomial time.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1993-119-01/S0002-9939-1993-1160298-8/S0002-9939-1993-1160298-8.pdf

Reference4 articles.

1. Addison-Wesley Series in Computer Science and Information Processing;Aho, Alfred V.,1975

2. Word Processing in Groups

3. The Euclidean traveling salesman problem is 𝑁𝑃-complete;Papadimitriou, Christos H.;Theoret. Comput. Sci.,1977

4. Growth series of some wreath products;Parry, Walter;Trans. Amer. Math. Soc.,1992

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Orientable quadratic equations in free metabelian groups;Journal of Algebra;2021-09

2. Amenability of semigroups and the Ore condition for semigroup rings;Semigroup Forum;2021-03-09

3. Logspace computations in graph products;Journal of Symbolic Computation;2016-07

4. Random walks on free solvable groups;Mathematische Zeitschrift;2014-11-04

5. Algorithmic theory of free solvable groups: Randomized computations;Journal of Algebra;2014-06