Efficient Computation in Finite Groups

有限群中的高效计算

• 批准号: 9503430
• 负责人: Akos Seress
• 金额: --
• 依托单位: Ohio State University Research Foundation -DO NOT USE
• 依托单位国家: 美国
• 项目类别: Continuing grant
• 财政年份: 1995
• 资助国家: 美国
• 起止时间: 1995-09-01 至 1998-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9503430&HistoricalAwards=false
• 关键词: Efficient; Computation; Finite; Groups

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.

这个项目继续在有限群的操作和它们的参数估计领域的研究。有限群算法及其相关的Cayley图在数学和计算机科学中有着广泛的应用。这些应用范围从与有限简单群的分类相关的问题到马尔可夫链的混合率，大型CPU交互阵列的互连网络设计，图同构问题（与化学文档相关）和基于组的密码学（如DES）。预期结果的主要使用者将是计算群论和算法复杂性理论的领域；但是在其他提到的领域也有应用。