Computational complexity and equilibrium analysis form an interrelated field at the crossroads of theoretical computer science and game theory. Researchers in this area investigate the intrinsic ...

Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach. 1. On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer ...

Our era is defined by a constant flow of information. Data from smartphones, wearables and environmental sensors, connected to sharing and analysis platforms, accompany us daily, creating a digital ...

My past research has existed in the intersection of logic and descriptive set theory with computational complexity theory. Particular topics relevant to this research have centered around oracle ...