Algorithmics for Hard Problems

Aus VISki
Wechseln zu: Navigation, Suche

Overview

Abstract

This course unit looks into algorithmic approaches to the solving of hard problems. The seminar is accompanied by a comprehensive reflection upon the significance of the approaches presented for computer science tuition at high schools.

Content

First, the concept of hardness of computation is introduced (repeated for the computer science students). Then some methods for solving hard problems are treated in a systematic way. For each algorithm design method, it is discussed what guarantees it can give and how we pay for the improved efficiency.

Summaries

Exam Solutions

Additional Material

Literature

  • no literature here yet