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

Computer Science Professors Christos Papadimitriou and Mihalis Yannakakis received the John von Neumann Theory Prize for their research in computational complexity theory that explores the boundaries ...

Professor Uehara from JAIST works at the intersection of theoretical computer science, discrete mathematics, and the art of solving puzzles. His research strives to understand the computational ...

Computational complexity and proof systems constitute a cornerstone of theoretical computer science, addressing both the inherent difficulty of algorithmic problems and the efficiency of formal ...

Computational scientist and mathematician Avi Wigderson of the Institute for Advanced Study (IAS) in Princeton has won the 2023 A.M. Turing Award. The prize, which is given annually by the Association ...

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

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...