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 in broader contexts beyond constraint satisfaction problems. The research will examine the complexity of promise versions of constraint satisfaction problems and forge new connections to topics including optimization, parameter tractability, and extremal combinatorics. This award falls under the NSF's Computer and Information Science and Engineering program (CFDA #47.070), which supports investigator-initiated research and education across computing, communications, and information science and engineering.