A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach. 1. On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer ...

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

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out. Kenneth Regan paused at lunch in New York to glance at incoming texts from top ...

We preselected all newsletters you had before unsubscribing.

Faculty members in the department are actively engaged in research in the areas listed below. There are many opportunities for both undergraduate and graduate students to participate in these ...

Part of “Complexity Theory,” a new column on the tangled questions of our technological age. One of my biggest sources of joy in life is satisfying my intellectual curiosity. I feel almost certain ...

Ashutosh Trivedi is an Associate Professor of computer science at the University of Colorado Boulder. His researchinterests lie at the intersection of computer science, control theory, and machine ...

Researchers got a better look at the thoughts of chatbots, amateurs learned exactly how complicated simple systems can be, and quantum computers passed an essential milestone. The end of 2024 seems a ...

An international team of researchers has developed a new theoretical framework that bridges physics and biology to provide a unified approach for understanding how complexity and evolution emerge in ...

The theory group hosts various reading groups, typically a semester or a year long, most topics chosen by students and/or postdocs; typically everyone presents. Some are for credit, all are for fun!