Inhalt
[ 675CACM13 ] Subject Computer Algebra for Concrete Mathematics
|
|
|
|
 |
| Workload |
Mode of examination |
Education level |
Study areas |
Responsible person |
Coordinating university |
| 3 ECTS |
Structure |
B2 - Bachelor's programme 2. year |
Mathematics |
Peter Paule |
Johannes Kepler University Linz |
|
|
|
| Detailed information |
| Original study plan |
Bachelor's programme Bioinformatics 2013W |
| Objectives |
The learning goal is to develop basic skills and techniques which are relevant to problem solving when dealing with formulas related to enumeration, in particular, for the analysis of algorithms.
|
| Subject |
The lecture can be viewed as an algorithmic supplement
to the classical book "Concrete Mathematics" by Graham,
Knuth, and Patashnik. Namely, it presents computer algebra
tools for dealing with four mathematical concepts which play
a fundamental role in many different areas of mathematics
and computer science: symbolic sums, recurrence (difference)
equations, generating functions, and asymptotic estimates.
Their key features, in isolation or in combination, their
mastery by paper and pencil or by computer programs, and
their applications, also to "real world problems" like
the analysis of algorithms, are studied.
|
| Further information |
The accompanying UE is recommended;
but the lecture can be followed also without attending the UE.
- Accompanying books: besides "Concrete Mathematics", the
book "The Concrete Tetrahedron" by M. Kauers and P. Paule.
|
|
|
|
| Subordinated subjects, modules and lectures |
| |
|
|
