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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.- References.- Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo 44a7bd1d7925ce1f1bd00c0d6bd32d93
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 168. Codice articolo 26127751182
Quantità: 4 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 168 pp. Englisch. Codice articolo 9781493907472
Quantità: 2 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 168 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 132836305
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 168. Codice articolo 18127751172
Quantità: 4 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 152 pages. 9.00x6.00x0.25 inches. In Stock. Codice articolo 1493907476
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Kartoniert / Broschiert. Condizione: New. Codice articolo 4213896
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 authorpresents 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 ofcurrent research which makes the book especially appealing for students looking for a currently active research topic at theintersection of group theory and computer science. The word problem introduced in 1910 by Max Dehnis 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 168 pp. Englisch. Codice articolo 9781493907472
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9781493907472
Quantità: 1 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA80014939074766
Quantità: 1 disponibili