Group algorithms: Complexity, Theory and Practice.

群算法：复杂性、理论与实践。数学或物理系统的对称性通常最好用一种称为群的抽象结构来描述，而群通常表示为置换群或矩阵群。在这个项目中，我们将设计和分析一个通用的算法框架计算有限的群体。在置换群和矩阵群的上下文中，我们将产生原型实现。所提出的框架有可能彻底改变算法组理论，因为它汇集了理论和计算模型的群体。

Group algorithms: Complexity, Theory and Practice. The symmetry of a mathematical or physical system is often best described by an abstract structure called a group, and groups are commonly represented as groups of permutations or matrices. In this project we shall design and analyse a general algorithmic framework for computing with finite groups. In the context of permutation groups and matrix groups we will produce prototype implementations. The proposed framework has the potential to revolutionise algorithmic group theory as it draws together theoretical and computational models of groups.