Travel: NSF Student Travel Grant for 2023 Conference on Computational Complexity

旅行：2023 年计算复杂性会议 NSF 学生旅行补助金

• 批准号: 2326701
• 负责人: Benjamin Rossman
• 金额: $ 2万
• 依托单位: Duke University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-06-01 至 2025-05-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2326701&HistoricalAwards=false
• 关键词: Travel; NSF; Student; Grant; 2023

This award will support student attendance at the 38th Annual Computational Complexity Conference (CCC), in Warwick U.K., July 17 to 20, 2023. The field of computational complexity forms the backbone of theoretical computer science. The conference aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. The search for efficient algorithms has important ramifications in many areas of business, technology, and science. Complexity theory has helped with our understanding of fundamental difficulty underlying algorithmic issues and in turn has been able to motivate algorithm design for some of the most challenging computational problems.This award will provide partial support to approximately 12 students to attend this top conference in the area of complexity theory. Efforts will be made to support students from under-represented groups and geographic diversity among students will also be taken into account. The award will encourage and facilitate student participation in this top-tier computer science conference. 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 that CCC fosters.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.

该奖项将支持学生参加在英国沃里克举行的第38届年度计算复杂性会议（CCC），2023年7月17日至20日。计算复杂性领域构成了理论计算机科学的支柱。会议旨在促进计算复杂性理论各个领域的研究，研究资源约束下计算模型的绝对和相对能力。寻找有效的算法在商业、技术和科学的许多领域都有重要的影响。复杂性理论帮助我们理解了算法问题的基本困难，反过来又能够激励算法设计解决一些最具挑战性的计算问题。该奖项将为大约12名学生提供部分支持，以参加复杂性理论领域的顶级会议。将努力支持来自代表性不足群体的学生，并将考虑到学生的地域多样性。该奖项将鼓励和促进学生参与这个顶级计算机科学会议。它将有助于吸引更多的未被充分代表的群体参与计算机科学研究，让学生有机会参与CCC促进的重要技术，专业和社会交流。该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。