Efficient Computation in Finite Groups

该项目继续在以下领域进行研究： 有限群的操作及其估计 参数 有限群及其相关Cayley图的算法具有 广泛应用于数学和计算机科学。 这些 应用范围从有限简单的分类问题 群的混合率马尔可夫链的互连设计 网络的大型交互阵列的CPU的，图同构问题 (of与化学文献的相关性）和基于组的密码学（例如 作为DES）。 预期结果的主要消费者将是以下领域： 计算群论和算法的复杂性理论;但是 在所提到的其他领域中也出现了应用。

This project continues research in the area of manipulation of finite groups and estimation of their parameters. Algorithms for finite groups and their associated Cayley graphs have a wide range of applications in mathematics and computer science. These applications range from problems related to the classification of finite simple groups to the mixing rate of Markov chains, the design of interconnection networks for large interacting arrays of CPU's, the graph isomorphism problem (of relevance to chemical documentation), and group-based cryptography (such as DES). The principal consumers of the expected results will be the areas of computational group theory and the complexity theory of algorithms; but applications arise in the other areas mentioned as well.