The compressed word problem for groups / Markus Lohrey.

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

Saved in:
Bibliographic Details
Main Author: Lohrey, Markus (Author)
Format: Ebook
Language:English
Published: New York, NY : Springer, 2014.
Series:SpringerBriefs in mathematics,
Subjects:
Online Access:Springer eBooks

MARC

LEADER 00000czm a2200000 i 4500
003 OCoLC
005 20221102182842.0
006 m o d
007 cr cnu---|nuuu
008 140417s2014 nyua ob 001 0 eng d
011 |a BIB MATCHES WORLDCAT 
011 |a Direct Search Result 
011 |a EDS Title: The Compressed Word Problem for Groups 
011 |a Has 323 WorldCat Holdings 
011 |a MARC Score : 11050(22650) : OK 
020 |a 1493907484  |q Internet 
020 |a 9781493907489  |q Internet 
020 |z 1493907476  |q print 
020 |z 9781493907472  |q print 
035 |a (ATU)b19494683 
035 |a (EDS)EDS2770871 
035 |a (OCoLC)876906553 
040 |a GW5XE  |b eng  |e rda  |c GW5XE  |d N$T  |d IDEBK  |d YDXCP  |d COO  |d OCLCF  |d E7B  |d EBLCP  |d OCLCQ  |d ATU 
050 4 |a QA63 
082 0 4 |a 512.2  |2 23 
100 1 |a Lohrey, Markus,  |e author.  |9 861199 
245 1 4 |a The compressed word problem for groups /  |c Markus Lohrey. 
264 1 |a New York, NY :  |b Springer,  |c 2014. 
300 |a 1 online resource (xii, 153 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a SpringerBriefs in Mathematics,  |x 2191-8198 
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. 
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. 
538 |a Mode of access: World Wide Web. 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed April 17, 2014). 
650 0 |a Group theory.  |9 318586 
650 0 |a Word problems (Mathematics)  |9 330721 
776 0 8 |i Printed edition:  |z 9781493907472 
830 0 |a SpringerBriefs in mathematics,  |x 2191-8198.  |9 860508 
856 4 0 |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/978-1-4939-0748-9  |z Springer eBooks  |x TEMPORARY ERM URL 
907 |a .b19494683  |b 06-09-21  |c 04-11-16 
942 |c EB 
998 |a none  |b 23-06-17  |c m  |d z   |e -  |f eng  |g nyu  |h 4 
999 |c 1370720  |d 1370720 
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.