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

In the first week of the fall semester in 2007, Marco Carmosino dragged himself to a math class required for all computer science majors at the University of Massachusetts, Amherst. Carmosino, a ...

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

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

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!