Andere Kunden interessierten sich auch für
![Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces]( "Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces")
Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces37,99 €![Finitely Presented Groups]( "Finitely Presented Groups")
Finitely Presented Groups119,95 €![An Invitation to Hypoelliptic Operators and Hörmander's Vector Fields]( "An Invitation to Hypoelliptic Operators and Hörmander's Vector Fields")
An Invitation to Hypoelliptic Operators and Hörmander's Vector Fields48,99 €![An Introduction to Ultrametric Summability Theory]( "An Introduction to Ultrametric Summability Theory")
An Introduction to Ultrametric Summability Theory37,99 €![Fixed Point of the Parabolic Renormalization Operator]( "Fixed Point of the Parabolic Renormalization Operator")
Fixed Point of the Parabolic Renormalization Operator37,99 €![The Convergence Problem for Dissipative Autonomous Systems]( "The Convergence Problem for Dissipative Autonomous Systems")
The Convergence Problem for Dissipative Autonomous Systems37,99 €![Sub-Riemannian Geometry and Optimal Transport]( "Sub-Riemannian Geometry and Optimal Transport")
Sub-Riemannian Geometry and Optimal Transport52,99 €
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.