Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

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

A UB COMPUTER scientist, Jin-Yi Cai, and a computer science graduate student, D. Sivakumar, have proven one of the oldest conjectures in the field of complexity theory. They did it using a combination ...

When the Clay Mathematics Institute put individual $1-million prize bounties on seven unsolved mathematical problems, they may have undervalued one entry—by a lot. If mathematicians were to resolve, ...

The “sensitivity” conjecture stumped many top computer scientists, yet the new proof is so simple that one researcher summed it up in a single tweet. A paper posted online this month has settled 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 ...

Our research area encompasses the study of computation, computational models, computational complexity, algorithm design, algorithm verification, combinatorial optimization, computational biology and ...