ANNOUNCEMENT

NOBEL PRIZE 2026

This year's laureates, their fields, and the discoveries that earned them the prize.Live nowSee the winners
Moonbase
← Back to Awards
NSFDirectorate for Computer and Information Science and Engineering

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

Completed
Institution
Duke University, NC
Principal investigator
Benjamin Rossman
Funding
$20K
Duration
2023–2025
Open portfolio

Moonbase score

Still being scored

Abstract

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.

LOADING MOONBASE SCORE

Directorate for Computer and Information Science and EngineeringCONFERENCE AND WORKSHOPSAlgorithmic FoundationsCOMPLEXITY & CRYPTOGRAPHYcomplexitytravelunder-represented groupscomputational complexitycomputer scienceccccomputationalunder-represented

Questions for Duke University

Answered by the team behind this research.

Same institution, same topic, scored first.