Teaching reduction as an algorithmic problem-solving strategy

Project members

  • Prof. Michal Armoni
  • Dr. Iris Gaber, The Academic College of Tel-Aviv Yaffo
  • Dr. David Statter, Afeka Academic College of Engineering


Reduction is a fundamental idea and a powerful tool in computer science, relevant in multiple contexts across the discipline, including algorithmic design, data structures, computability theory, and complexity theory. However, in most computer science curricula reduction is insufficiently emphasized and its teaching is limited to specific contexts. This project examines the applicability and effectiveness of a new instructional strategy for teaching reduction in an undergraduate course on algorithmic design.

Links for further reading