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

This blog is a continuation of the Building AI Leadership Brain Trust Blog Series which targets board directors and CEO’s to accelerate their duty of care to develop stronger skills and competencies ...

Kolmogorov complexity uses computer science to measure the amount of information (or randomness) contained in finite objects. In addition to being interesting philosophically, Kolmogorov complexity ...

Elkind, a pioneer of algorithmic game theory, computational social choice, and artificial intelligence, joined Northwestern Engineering’s Department of Computer Science on November 1 as a Ginni ...

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

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

Today’s digital economy is blurring the boundaries between computer science and economics — in Silicon Valley, on Wall Street, and increasingly on university campuses. Yale undergraduates interested ...