Amey Bhangale is interested in the computational complexity of fundamental problems in theoretical computer science. His research focuses on developing efficient approximation algorithms that produce solutions with provable guarantees on their closeness to the optimal. His CAREER project aims to develop optimal approximation algorithms for a broad class of problems known as constraint satisfaction problems (CSPs). This work leads to exploring key mathematical questions whose insights will contribute to solving problems in additive combinatorics and complexity theory.