Graph theory has long provided a robust mathematical framework for investigating networks, relations and connectivity in both abstract and applied settings. Recent advances have markedly refined our ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

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 ...

Surprising connections between computer science and biology, two disciplines that study how information proliferates in time and space, have been revealed by a recent study. The authors of a new ...

Since the 1930s, the theory of computation has profoundly influenced philosophical thinking about topics such as the theory of the mind, the nature of mathematical knowledge and the prospect of ...

A major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

In the last few years, a few dedicated mathematicians have begun to study the computational complexity of video games. Their goal is to determine the inherent difficulty of the games and how they ...

Kolmogorov complexity uses computer science to measure the amount of information (or randomness) contained in finite objects. In addition to being interesting philosophically, Kolmogorov complexity ...

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 ...