Collaborative Research: AF:Medium: Structure and Quasi-Polynomial Time Algorithms — NSF Award to Princeton University (NJ, $295,09
Throughout mathematics and computer science there is an over-arching connection between structural and descriptive mathematical statements and efficient algorithms. Here efficient algorithms mean polynomial time algorithms. These are algorithms whose running time scales well with the size of the input data that they ar
| Award title | Collaborative Research: AF:Medium: Structure and Quasi-Polynomial Time Algorithms |
|---|---|
| Award ID | 2505100 |
| Awardee | Princeton University |
| City | PRINCETON |
| State | NJ |
| Amount obligated | $295,099 |
| Principal investigator | Maria Chudnovsky |
| Program | Algorithmic Foundations |
| Start date | 10/01/2025 |
| Abstract | Throughout mathematics and computer science there is an over-arching connection between structural and descriptive mathematical statements and efficient algorithms. Here efficient algorithms mean polynomial time algorithms. These are algorithms whose running time scales well with the size of the input data that they are supposed to process. When you double the size of the data, the time taken to process it also get doubled, or at worst multiplied by a fixed constant. Efficient algorithms permeat |
| Source | NSF Awards |
$799/mo
Try NSFGrants →