The Compressed Word Problem for Groups

The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent results on the compressed...

Full description

Bibliographic Details
Main Author: Lohrey, Markus
Format: eBook
Language:English
Published: New York, NY Springer New York 2014, 2014
Edition:1st ed. 2014
Series:SpringerBriefs in Mathematics
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02760nmm a2200337 u 4500
001 EB000738744
003 EBX01000000000000000590176
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140505 ||| eng
020 |a 9781493907489 
100 1 |a Lohrey, Markus 
245 0 0 |a The Compressed Word Problem for Groups  |h Elektronische Ressource  |c by Markus Lohrey 
250 |a 1st ed. 2014 
260 |a New York, NY  |b Springer New York  |c 2014, 2014 
300 |a XII, 153 p. 27 illus  |b online resource 
505 0 |a 1. Preliminaries from Theoretical Computer Science -- 2. Preliminaries from Combinatorial Group Theory -- 3. Algorithms on Compressed Words -- 4. The Compressed Word Problem -- 5. The Compressed Word Problem in Graph Products -- 6. The Compressed Word Problem in HNN-Extensions -- 7.Outlook -- References -- Index 
653 |a Group theory 
653 |a Mathematical analysis 
653 |a Topological Groups, Lie Groups 
653 |a Lie groups 
653 |a Topological groups 
653 |a Analysis 
653 |a Group Theory and Generalizations 
653 |a Analysis (Mathematics) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a SpringerBriefs in Mathematics 
856 4 0 |u https://doi.org/10.1007/978-1-4939-0748-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 512.2 
520 |a The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontier of current research which makes the book especially appealing for students looking for a currently active research topic at the intersection of group theory and computer science. The word problem introduced in 1910 by Max Dehn is one of the most important decision problems in group theory. For many groups, highly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithms for word problems, has been developed, by representing long words over group generators in a compressed form using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressed word problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups