5 search results - page 1 / 1 » Compressed Conjugacy and the Word Problem for Outer Automorp... |
DLT
2010
13 years 7 months ago
2010
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
IJAC
2010
13 years 4 months ago
2010
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
IJAC
2007
13 years 6 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
CORR
2002
Springer
13 years 6 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...