Conference on Algorithmic Problems in Groups and Semigroups, May 11-15, 1998

该奖项支持内布拉斯加州大学的“群和半群中的算法问题”会议。会议将包括20场演讲和精选的简短文章。正在努力将研究生和年轻的研究人员包括在内。算法群论领域是群论——对称的数学研究——和计算之间的一个界面区域。在群体中研究这种算法将有助于更好地理解“计算的复杂性”。

Meakin 9803828This award supports a conference on "Algorithmic Problems in Groups and Semigroups "at the University of Nebraska. The conference will consist of twenty lectures and selectedshort contributions. Efforts are being made to include graduate students and young investigators .The field of algorithmic group theory is an interface area between group theory---themathematical study of symmetry---and computation. The study of such algorithms ingroups will lead to a better understanding of "complexity of computation."