AF: Student Travel to CCC 2017

该奖项将支持学生参加2017年7月6日至9日在拉脱维亚里加举行的第32届年度计算复杂性会议(CCC)。计算复杂性领域构成了理论计算机科学的支柱。会议旨在促进计算复杂性理论的所有领域的研究，研究资源约束下计算模型的绝对和相对能力。对高效算法的研究在商业、技术和科学的许多领域都有重要的影响。复杂性理论有助于我们理解潜在的算法问题的基本困难，并反过来能够激励一些最具挑战性的计算问题的算法设计。这一奖项将为大约10名学生提供部分支持，让他们参加这个复杂性理论领域的顶级会议。将努力支持代表不足的群体的学生，并将考虑到学生之间的地域差异。该奖项将鼓励和促进学生参与这个顶级的计算机科学会议。它将有助于吸引更多代表不足的群体从事计算机科学研究，让学生有机会参与CCC培养的重要的技术、专业和社会交流。

This award will support student attendance at the 32nd Annual Computational Complexity Conference (CCC), in Riga, Latvia, July 6 to 9, 2017.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 10 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 be taken into account.The award will encourage and facilitate the 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 ex-changes that CCC fosters.