课题基金 / 基金详情

Conference on Groups and Computation, June 14-18, 1999, Columbus, Ohio

Conference on Groups and Computation, June 14-18, 1999, Columbus, Ohio
群与计算会议,1999 年 6 月 14-18 日,俄亥俄州哥伦布
批准号:
9970136
负责人:
Akos Seress
金额:
$0.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1999
资助国家:
美国
项目状态:
已结题
起止时间:
1999-05-01 至 1999-10-31

项目摘要

项目成果

Akos Seress的其他基金

相似基金

相关文献

中文摘要
翻译
9970136关于"群与计算“的会议将于1999年6月14-18日在俄亥俄州州立大学举行。 提议者要求提供资金,以确保来自欧洲和澳大利亚的主要研究人员的参与,并协助研究生和最近的博士学位获得者。 会议的主要目标是提供一个论坛,将计算的理论和实践与群体相结合。 预计这将导致更深层次的数学问题,基础组计算的理解,这些将有重要的算法的影响,因为我们走向下一代的计算机体系结构。 1991年和1995年在DIMACS(罗格斯大学)举行的“群与计算”相关讲习班证明了这一目标有可能实现。 这些讲习班的一个主要目标是促进研究群体计算复杂性的研究人员与开发实用算法的人员之间的对话。 与会者在会议期间和会议之后发表了许多评论,认为这一目标的实现超出了组织者的预期,并带来了新的视角和新的合作。 作为一个直接的结果,实际版本的算法最初开发的理论家,以改善最坏情况下的渐近运行时间,其中一些已实施的主要计算群论系统。为研究生和年轻的研究人员提供机会,作为参与者和演讲者,是以前研讨会的另一个成功方面,也将是这次研讨会的一个重要特点。计算群论是一个跨学科的领域,涉及使用群体来解决计算机科学和数学中的问题。 会议将探讨研究的相互作用已经发生在一些广泛的领域:符号代数,理论计算机科学,群论和群计算的应用。 除了各种各样的数学和计算机科学问题的会谈,在过去的会议上,这个主题已经有大量的会谈链接到统计,电路设计,数字信号处理,并使用并行架构在这个分支的符号代数。 国际上采用的主要计算群论系统对数学及其应用的研究产生了影响;根据以往的经验,快速的新方法将从拟议的会议中产生,并将在这些系统中实现。
英文摘要
9970136A conference on ``Groups and Computation'' will be held on June 14-18, 1999, at The Ohio State University. The proposers request funding in order to ensure participation by leading researchers from Europe and Australia and to assist graduate students and recent PhD recipients. The main objective of the conference is to provide a forum for merging theory and practice of computations with groups. It is expected that this will result in increased understanding of the deeper mathematical issues that underlie group computations, and that these will have important algorithmic implications as we move toward the the next generation of computer architectures. That this objective is likely to be met is evidenced by previous related workshops on ``Groups and Computation'' held at DIMACS (in Rutgers University) in 1991 and 1995. A primary goal of those workshops was to foster a dialogue between researchers studying the complexity of group computations and those engaged in the development of practical algorithms. There were many comments by participants, both during and afterwards, that this goal had been achieved beyond the organizers' expectations, and had led to new perspectives and new collaborations. As a direct result, practical versions were devised for algorithms initially developed by theoreticians to improve worst case asymptotic running times; some of these have been implemented in the major computational group theory systems. Providing opportunities for graduate students and younger researchers, both as participants and as speakers, was another of the many successful aspects of previous workshops, and will be an important feature of this one as well.Computational group theory is an interdisciplinary field involving the use of groups to solve problems in computer science and mathematics. The conference will explore the interplay of research which has taken place in a number of broad areas: symbolic algebra, theoretical computer science, group theory, and applications of group computation. In addition to talks on a wide variety of mathematical and computer science issues, at past conferences on this subject there have been numerous talks on links to statistics, circuit design, digital signal processing, and the uses of parallel architectures within this branch of symbolic algebra. The major computational group theory systems employed internationally have had impacts on research within mathematics as well as its applications; based on previous experience, fast new approaches will come out of the proposed conference and will be implemented in these systems.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Supplemental Funding for a Conference on: Combinatorics, groups, algorithms, and complexity; March 2010; Columbus, OH
Collaborative Research: Groups in Computer Science
Supplemental funding for a Conference on: Groups and Computation
Efficient Computation in Finite Groups
海外基金