New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

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

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 30th Annual European Symposium on Algorithms awarded its 2021 Test-of-Time Award to Sorin Istrail, professor of computational and mathematical sciences and professor of computer science, and his ...

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

Physicists know about the huge chasm between quantum physics and the theory of gravity. However, in recent decades, theoretical physics has provided some plausible conjecture to bridge this gap and to ...

In 2006, economists at the Federal Reserve Bank of New York started to worry about the overheating US housing market. Concerned that the bubble might burst, they used their best model to predict what ...