From greedy shortcuts to dynamic programming guarantees, algorithm design techniques are the backbone of efficient problem-solving in computer science. Understanding when and how to apply each ...

Quantum computing has entered a bit of an awkward period. There have been clear demonstrations that we can successfully run quantum algorithms, but the qubit counts ...

Northwestern Engineering’s Samir Khuller welcomed the presenters and guests of part two of the Undergraduate Research Showcase by discussing the importance of academic curiosity. “Knowledge is not a ...

Researchers from the Department of Electrical Engineering at Tokyo University of Science in Japan have developed what “a novel approach” to combinatorial optimisation problems (COPs). COPs are ...

Collaborative, creative, and fast-paced, WildHacks is Northwestern’s largest hackathon. The annual coding-based competition is designed for all students to learn and broaden their programming skills.

An attempt at tackling the intractable Collatz conjecture is a “noble failure” demonstrating the promise of automated reasoning techniques. The computer scientist Marijn Heule is always on the lookout ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...