32 search results - page 1 / 7 » Complexity of Unification in Free Groups and Free Semi-group... |
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
IJAC
2007
13 years 4 months ago
2007
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
IJAC
2007
13 years 4 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...
DFN
2003
13 years 6 months ago
2003
: Large-scale deployment of virtual private networks with hundreds or thousands of clients means a constant battle with complexity that can only be won by setting up powerful authe...
IJAC
2008
13 years 4 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...