课题基金 / 基金详情

NSF Student Travel Grant for 2019 Caleidoscope Research School in Computational Complexity (Caleidoscope)

NSF Student Travel Grant for 2019 Caleidoscope Research School in Computational Complexity (Caleidoscope)
NSF 学生旅费资助 2019 年 Caleidscope 研究学院计算复杂性 (Caleidscope)
批准号:
1930589
负责人:
Aleksandr Knop
金额:
$0.5万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2019
资助国家:
美国
项目状态:
已结题
起止时间:
2019-07-01 至 2020-06-30

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
该奖项将支持学生参加万花筒学校,这是一个为期一周的计算复杂性暑期学校,将于2019年6月17日至21日在法国巴黎举行。万花筒适用于研究生以及希望更多地了解邻近地区的知名研究人员。该奖项将为大约6名学生提供部分支持。将努力支持来自代表性不足群体的学生,并考虑到学生的地理多样性。它将有助于吸引更多代表性不足的群体参与计算机科学研究,使学生有机会参与重要的技术、专业和社会交流。计算复杂性理论诞生于50多年前,当时研究人员开始研究什么可以有效地计算。根据解决或计算所需的资源量(例如时间和/或空间)对问题或功能进行分类是一个极其困难的问题。这导致研究人员开发了各种各样的方法,采用不同的数学方法和理论。复杂性理论的未来发展将需要对许多当前方法的异同和局限性有一个微妙的理解。事实上,尽管这些方法研究的是相同的现象,但它们是在脱节的社区中发展起来的,它们之间很少或根本没有交流(例如算法、逻辑、编程理论、代数等)。这种分散是不幸的,因为它阻碍了混合方法的发展,更一般地说,阻碍了整体计算复杂性的提高。万花筒学派的目标(和特点)是在一个单一的事件中重新聚集尽可能多的不同的计算复杂性,可以在一周内合理地适应。该奖项反映了美国国家科学基金会的法定使命,并通过使用基金会的知识价值和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
This award will support student attendance at the Caleidoscope school, a one-week summer school in computational complexity to be held in Paris, France, June 17-21, 2019. Caleidoscope is intended for graduate students as well as established researchers who wish to learn more about neighboring areas. This award will provide partial support to approximately 6 students to attend this school. Efforts will be made to support students from under-represented groups and geographic diversity among students will be taken into account. It will contribute towards attracting more under-represented groups to computer science research giving students an opportunity to engage in the important technical, professional, and social exchanges.Computational complexity theory was born more than 50 years ago when researchers started asking what could be computed efficiently. Classifying problems or functions with respect to the amount of resources (e.g. time and/or space) needed to solve or compute them turned out to be an extremely difficult question. This has led researchers to develop a remarkable variety of approaches, employing different mathematical methods and theories. The future development of complexity theory will require a subtle understanding of the similarities, differences, and limitations of the many current approaches. In fact, even though these approaches study the same phenomena, they are developed today within disjoint communities, with little or no communication between them (e.g. algorithms, logic, programming theory, algebra, etc.). This dispersion is unfortunate since it hinders the development of hybrid methods and more generally the advancement of computational complexity as a whole. The goal (and peculiarity) of the Caleidoscope school is to reunite in a single event as many different takes on computational complexity as can reasonably be fit in one week.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金