A computer scientist has achieved a breakthrough in a nearly 25-year-old problem involving how computers calculate distances ...

People have performed many mathematical proofs to show that a quantum computer will vastly outperform traditional computers on a number of algorithms. But the quantum ...

See how AI is changing algorithm discovery, theorem proving, and complexity theory, with real research examples and a clear look at its limitations.

AI can help theoretical computer scientists search for algorithms, proof components, and combinatorial structures. Here’s what recent results show—and why verification still matters.

Bio: Alfred V. Aho is the Lawrence Gussman Professor Emeritus of Computer Science at Columbia University. He has served as Vice President of the Computing Sciences Research Center at Bell Labs, the ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Click to tell Google to ...

As data science continues to evolve, the k-means clustering algorithm remains a valuable tool to uncover insights and patterns within complex datasets. Understanding the elbow method and the ...

Algorithms have taken on an almost mythical significance in the modern world. They determine what you see on social media and when browsing online, help form people’s belief systems, and impact the ...

The original version of this story appeared in Quanta Magazine. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.

Three computer scientists have disproved a long-standing conjecture about a fundamental problem involving imperfect information. Click to tell Google to prioritize Quanta and see more of the best ...

A subplan is an optional enhancement to the Professional MS in Computer Science (MSCPS) degree program allowing students to demonstrate a high level of expertise in a sub-field of Computer Science.