The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

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

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

Our research area encompasses the study of computation, computational models, computational complexity, algorithm design, algorithm verification, combinatorial optimization, computational biology and ...

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

NEW YORK, August 16, 2018 - The 2018 Donald E. Knuth Prize will be awarded to Johan Torkel Håstad of the KTH Royal Institute of Technology (Sweden) for his long and sustained record of milestone ...

Wigderson is the Herbert H. Maass Professor in the School of Mathematics at the Institute for Advanced Study in Princeton, New Jersey. He has been a leading figure in areas including computational ...

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

Physicists and computer scientists have recently expanded the modern theory of the thermodynamics of computation. By combining approaches from statistical physics and computer science, the researchers ...