173 search results - page 1 / 35 » Groups with poly-context-free word problem |
DLT
2010
13 years 6 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...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
IJAC
2010
13 years 3 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 ...
INFORMATICALT
2007
13 years 4 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...