This National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Award (CFDA 47.070) in the amount of $245,755 provides funding for a 5-year research project at the Regents of the University of California at Riverside. The project focuses on developing analytical and algebraic methods to efficiently approximate solutions to a fundamental class of optimization problems, known as constraint satisfaction problems (CSPs), which have applications in domains such as manufacturing, scheduling, and chip design. The research aims to characterize the approximation thresholds of finite-domain CSPs, advance the understanding of ordering CSPs, and apply the mathematical tools to problems in additive combinatorics and complexity theory. The project also includes an educational outreach component to foster enthusiasm for mathematics and computational research among high school and undergraduate students, particularly from underrepresented groups in STEM fields. No sub-awards are planned for this grant.
Mod # | Description | Reason For Modification | Federal Obligation (Click to sort descending) | Date (Click to sort ascending) |
|---|---|---|---|---|
| Not listed | $245.8k | 1/14/25 |