Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| 18cs500 [2018-06-17] – Martin Ziegler | 18cs500 [2018-07-01] (current) – Martin Ziegler | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | | + | ====== Design and Analysis of Algorithms (CS500) in Spring 2018 at KAIST' |
| All Computer Science is based on the concept of an efficient algorithm: a finite sequence of primitive instructions that, when executed according to their well-specified semantics, provably provide a mechanical solution to the infinitely many instances of a complex mathematical problem within a guaranteed number of steps of least asymptotic growth. We thus call these the ' | All Computer Science is based on the concept of an efficient algorithm: a finite sequence of primitive instructions that, when executed according to their well-specified semantics, provably provide a mechanical solution to the infinitely many instances of a complex mathematical problem within a guaranteed number of steps of least asymptotic growth. We thus call these the ' | ||