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

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

Theory of Computation offers a rigorous mathematical framework that underpins our understanding of what can be computed and how efficiently these computations may be performed. It encompasses ...

Counting Constraint Satisfaction Problems (commonly referred to as #CSP) form a foundational framework in computational complexity theory by addressing the challenge of enumerating all possible ...

The original version of this story appeared in Quanta Magazine. One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling ...

For Shang-Hua Teng, theoretical computer science has never been purely theoretical. Now 58, Teng is a professor of computer science at the University of Southern California and a two-time winner of ...

The Northwestern CS Theory Group and Toyota Technological Institute at Chicago co-hosted the Junior Theorists Workshop held Dec. 8-9 The Junior Theorists Workshop, held Dec. 8-9, was more than just a ...

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

One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling discovery about the relationship between time and memory in computing.

The original version of this story appeared in Quanta Magazine. Pose a question to a Magic 8 Ball, and it’ll answer yes, no, or something annoyingly indecisive. We think of it as a kid’s toy, but ...