Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
The Compressed Word Problem for Groups : SpringerBriefs in Mathematics - Markus Lohrey

The Compressed Word Problem for Groups

By: Markus Lohrey

eText | 4 April 2014

At a Glance

eText

$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionMathematicsAlgebraGroups & Group TheoryCalculus & Mathematical AnalysisTopology

More in Algebra

Enriques Surfaces I - François Cossec

eTEXT

Enriques Surfaces I

eText

$289.00

Finite Groups I - Bertram Huppert

eTEXT

Finite Groups I

eText

$349.00

The Monodromy Group - Henryk ?o??dek

eTEXT

The Monodromy Group

eText

$269.01

(Generalized) Fuzzy Matrices and Relations - Herbert Toth

eBOOK

(Generalized) Fuzzy Matrices and Relations

eBook

RRP $226.36

$203.99

10%
OFF

This product is categorised by