๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Algorithms and Classification in Combinatorial Group Theory (Mathematical Sciences Research Institute Publications, 23)

โœ Scribed by Gilbert Baumslag (editor), Charles F. III Miller (editor)


Publisher
Springer
Year
2011
Tongue
English
Leaves
234
Edition
Softcover reprint of the original 1st ed. 1992
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G. Baumslag, F.B. Cannonito and C.F. Miller III. The pa- pers in this volume are an outgrowth of lectures at this conference. The first three papers are concerned with decision problems and the next two with finitely presented simple groups. These are followed by two papers dealing with combinatorial geometry and homology. The remaining papers are about automatic groups and related topics. Some of these papers are, in essence, announcements of new results. The complexity of some of them are such that neither the Editors nor the Reviewers feel that they can take responsibility for vouching for the completeness of the proofs involved. We wish to thank the staff at MSRl for their help in organising the workshop and this volume.


๐Ÿ“œ SIMILAR VOLUMES


Algorithms and Classification in Combina
โœ Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. Miller III (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag New York ๐ŸŒ English

The papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics.

Combinatorial Group Theory (Classics in
โœ Roger C. Lyndon, Paul E. Schupp ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐ŸŒ English

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into 339 pages. [...] a valuable and welcome addition to the literature, containing many results not pre

Combinatorial Group Theory (Classics in
โœ Roger C. Lyndon, Paul E. Schupp ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐ŸŒ English

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into 339 pages. [...] a valuable and welcome addition to the literature, containing many results not pre

Combinatorial Optimization: Theory and A
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A
โœ Bernhard Korte ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This