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

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

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

We preselected all newsletters you had before unsubscribing.

Algorithmic complexity and information theory are foundational disciplines that intersect to elucidate how data is structured, transmitted and computed. At its core, algorithmic complexity seeks to ...

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

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

From powering search engines to securing data and optimizing networks, algorithms underpin nearly every aspect of modern technology. Understanding how efficiently they can solve problems — and where ...

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!

Space and time aren’t just woven into the background fabric of the universe. To theoretical computer scientists, time and space (also known as memory) are the two fundamental resources of computation.