One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

The quest for "quantum supremacy" – unambiguous proof that a quantum computer does something faster than an ordinary computer – has paradoxically led to a boom in quasi-quantum classical algorithms. A ...

Theoretical Foundations of Computer Science research at Drexel University's College of Computing & Informatics (CCI) explores the mathematical foundations of computing. CCI Computer Science research ...

You scrambled up a Rubik's cube, and now you want to put it back in order. What sequence of moves should you make? Surprise: You can answer this question with modern algebra. Most folks who have been ...

Quantum computers can do wondrous things: too bad they do not exist yet. That has not stopped physicists from devising new algorithms for the devices, which can calculate a lot faster than ordinary ...

When it comes to teaching math, a debate has persisted for decades: How, and to what degree, should algorithms be a focus of learning math? The step-by-step procedures are among the most debated ...