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

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

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

Say you want to send a private message, cast a secret vote or sign a document securely. If you do any of these tasks on a computer, you’re relying on encryption to keep your data safe. That encryption ...

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

Imagine you’re on a quest to understand the very nature of computation. You’re deep in the wilderness, far from any paths, and inscrutable messages are carved into the trunks of trees all around you — ...

Veronika Koren talks about pursuing a theory of neural coding that doesn’t fit a simple narrative, and the resilience it took to see it through.