Abstract
AbstractIn this chapter we prove two further important transfer theorems for the compressed word problem: The compressed word problem for a multiple HNN-extension of a base group H over finite associated subgroups is polynomial time Turing-reducible to the compressed word problem for H. The compressed word problem for an amalgamated product of group H 1 and H 2 with finite amalgamated subgroups is polynomial time Turing-reducible to the compressed word problems for H 1 and H 2. KeywordsPolynomial TimeWord ProblemBase GroupSemidirect ProductOracle AccessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
