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

群和半群算法问题会议，1998 年 5 月 11-15 日

• 批准号: 9803828
• 负责人: John Meakin
• 金额: $ 1万
• 依托单位: University of Nebraska-Lincoln
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1998
• 资助国家: 美国
• 起止时间: 1998-05-01 至 1998-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9803828&HistoricalAwards=false
• 关键词: Conference; Algorithmic; Problems; Groups; Semigroups

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."

Meakin 9803828该奖项支持在内布拉斯加州大学举行的关于“群和半群中的算法问题”的会议。会议将由20场讲座和精选的短文组成。正在努力将研究生和年轻的研究人员包括在内。算法群论领域是群论-对称性数学研究-和计算之间的交界区。对这类算法的分组研究将有助于更好地理解“计算的复杂性”。