HOME > Detail View

Detail View

The compressed word problem for groups [electronic resource]

The compressed word problem for groups [electronic resource]

Material type
E-Book(소장)
Personal Author
Lohrey, Markus.
Title Statement
The compressed word problem for groups [electronic resource] / Markus Lohrey.
Publication, Distribution, etc
New York, NY :   Springer New York :   Imprint: Springer,   2014.  
Physical Medium
1 online resource (xii, 153 p.) : ill.
Series Statement
Springer briefs in mathematics,2191-8198
ISBN
9781493907489
요약
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.
General Note
Title from e-Book title page.  
Content Notes
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.
Bibliography, Etc. Note
Includes bibliographical references and index.
이용가능한 다른형태자료
Issued also as a book.  
Subject Added Entry-Topical Term
Group theory. Word problems (Mathematics).
Short cut
URL
000 00000nam u2200205 a 4500
001 000046042996
005 20200908171938
006 m d
007 cr
008 200814s2014 nyua ob 001 0 eng d
020 ▼a 9781493907489
040 ▼a 211009 ▼c 211009 ▼d 211009
082 0 4 ▼a 512.2 ▼2 23
084 ▼a 512.2 ▼2 DDCK
090 ▼a 512.2
100 1 ▼a Lohrey, Markus.
245 1 4 ▼a The compressed word problem for groups ▼h [electronic resource] / ▼c Markus Lohrey.
260 ▼a New York, NY : ▼b Springer New York : ▼b Imprint: Springer, ▼c 2014.
300 ▼a 1 online resource (xii, 153 p.) : ▼b ill.
490 1 ▼a Springer briefs in mathematics, ▼x 2191-8198
500 ▼a Title from e-Book title page.
504 ▼a Includes bibliographical references and index.
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.
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.
530 ▼a Issued also as a book.
538 ▼a Mode of access: World Wide Web.
650 0 ▼a Group theory.
650 0 ▼a Word problems (Mathematics).
830 0 ▼a SpringerBriefs in mathematics.
856 4 0 ▼u https://oca.korea.ac.kr/link.n2s?url=http://dx.doi.org/10.1007/978-1-4939-0748-9
945 ▼a KLPA
991 ▼a E-Book(소장)

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Main Library/e-Book Collection/ Call Number CR 512.2 Accession No. E14031713 Availability Loan can not(reference room) Due Date Make a Reservation Service M

New Arrivals Books in Related Fields