Project Grant 2515155
Award Date
7/15/25
Completion Date
6/30/28
Dollars Obligated
$600K
Federal Agency
Division of Computing and Communication Foundations
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
New York, NY 10012, USA
Similar Awards
This Project Grant award of $245,755 from the National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Program (CFDA 47.070) supports research by the Regents of the University of California at Riverside (UC Riverside) to develop new mathematical frameworks and algorithms for approximating solutions to constraint satisfaction problems (CSPs). The research aims to advance the theoretical understanding of optimization and computation by leveraging deep...
This National Science Foundation Project Grant of $600,000 supports research on the complexity of satisfiable constraint satisfaction problems at the Massachusetts Institute of Technology from January 2023 through December 2025. Funded through the Computer and Information Science and Engineering program (CFDA 47.070), this award will advance the development of probabilistically checkable proofs theory through focused study of satisfiable constraint satisfaction problems, a fundamental class of...
This $500,000 project grant from the National Science Foundation Division of Computing and Communication Foundations' Computer and Information Science and Engineering program (CFDA 47.070) will fund research at Harvard University from March 2022 to February 2025 on streaming complexity of constraint satisfaction problems. The principal investigator will conduct a systematic study of the capabilities of streaming algorithms for constraint satisfaction problems, which are a class of optimization...
This $240,606 Project Grant award from the National Science Foundation's (NSF) Division of Mathematical Sciences under the Mathematical and Physical Sciences program (CFDA 47.049) supports fundamental research at the intersection of combinatorics, probability, and other fields. The project, led by researchers at New York University, explores threshold phenomena in random discrete structures and asymptotic enumeration problems on expander graphs. Key objectives include proving the "Second...
The National Science Foundation awarded New York University a $136,145 Project Grant under the Mathematical and Physical Sciences federal grant program (CFDA 47.049) from January 2023 through June 2025. The grant funding will support research focusing on problems at the intersection of combinatorics and probability with connections to other fields. Specifically, the Principal Investigator will investigate threshold phenomena in random discrete structures, with a goal of proving the Kahn-Kalai...
This National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Award (CFDA 47.070) in the amount of $600,000 will fund research to develop innovative cooperative stochastic local search algorithms for Boolean satisfiability (SAT) solving. The project aims to enhance collaboration between different SAT solving algorithms, both sequentially and in parallel, to create a powerful combined reasoning framework. This work will advance the state-of-the-art...
Colorado State University's Sponsored Programs division will provide $299,942 in research services over three years under a Project Grant from the National Science Foundation's Computer and Information Science and Engineering program (CFDA 47.070). The university will conduct collaborative research to develop new techniques in algorithms and complexity analysis to understand how global constraints influence the tractability of sampling and optimization problems on probabilistic graphical models....
This National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Award No. 2446604, with a CFDA number of 47.070, provides $600,000 in funding to the Regents of the University of Michigan from January 1, 2026 to December 31, 2028. The grant supports fundamental and applied research in extremal combinatorics and the analysis of algorithms, with a focus on solving classification questions in pattern-avoiding 0-1 matrices and applying these methods to...
This $193,399 Project Grant award from the National Science Foundation (NSF) Computer and Information Science and Engineering (CFDA 47.070) Federal Grant Program supports a research project at New York University (NYU) titled "CAREER: RESOURCE-CONSTRAINED APPROACHES TO CRYPTOGRAPHY". The goal of the project is to strengthen the foundations of computational intractability needed for robust cryptography, in order to yield a more robust cryptographic infrastructure. The research will...
The National Science Foundation Division of Computing and Communication Foundations awarded a $313,582 Project Grant to the Regents of the University of California, doing business as the University of California, Berkeley, to support research exploring the relationship between computational problem structure and algorithmic efficiency. Specifically, the six-month award beginning March 1, 2022 will investigate the existence of "polymorphic principles" that allow for efficient algorithms...