Name: The Compressed Word Problem for Groups (Springerbriefs in Mathematics) (en Inglés)
SKU: 50874877
Price: 65.07 USD
Availability: InStock
Author: Markus Lohrey
ISBN: 9781493907472

portada The Compressed Word Problem for Groups (Springerbriefs in Mathematics) (en Inglés)

The Compressed Word Problem for Groups (Springerbriefs in Mathematics) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Markus Lohrey

Año

2014

Idioma

Inglés

N° páginas

168

Encuadernación

Tapa Blanda

ISBN13

9781493907472

N° edición

2014

Categorías

Álgebra

The Compressed Word Problem for Groups (Springerbriefs in Mathematics) (en Inglés)

Markus Lohrey (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 21 a 28 días háb.

$ 108.45$ 65.07

-40%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 65.07

Llega entre el 14 Sep y el 25 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "The Compressed Word Problem for Groups (Springerbriefs in Mathematics) (en Inglés)"

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.