عنوان

The compressed word problem for groups /

شابک

1493907484 (electronic bk.)

شابک

9781493907489 (electronic bk.)

شابک اشتباه

1493907476 (print)

شابک اشتباه

9781493907472

شابک اشتباه

9781493907472 (print)

شماره

dltt

عنوان اصلي

The compressed word problem for groups /

نام عام مواد

[Book]

نام نخستين پديدآور

Markus Lohrey

نام خاص و کميت اثر

1 online resource (xii, 153 pages) :

ساير جزييات

illustrations.

عنوان فروست

SpringerBriefs in Mathematics,

شاپا ي ISSN فروست

2191-8198

متن يادداشت

Includes bibliographical references and index

متن يادداشت

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

بدون عنوان

0

متن يادداشت

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

شماره استاندارد بين المللي کتاب و موسيقي

9781493907472

موضوع مستند نشده

Group theory.

موضوع مستند نشده

Word problems (Mathematics)

موضوع مستند نشده

Analysis.

موضوع مستند نشده

Group Theory and Generalizations.

موضوع مستند نشده

Mathematics.

موضوع مستند نشده

Topological Groups, Lie Groups.

موضوع مستند نشده

MAT-- 002040

موضوع مستند نشده

MAT002010

موضوع مستند نشده

PBG

شماره

ويراست

شماره رده

مستند نام اشخاص تاييد نشده

Lohrey, Markus

مستند نام تنالگان تاييد نشده

Ohio Library and Information Network.

تاريخ عمليات

20201222074646.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

کد کاربرگه

270410

تكميل شده

Y