Inhalt

[ 675CACM13 ] Studienfach (*)Computer Algebra for Concrete Mathematics

Versionsauswahl
(*) Leider ist diese Information in Deutsch nicht verfügbar.
Workload Form der Prüfung Ausbildungslevel Studienfachbereich VerantwortlicheR Anbietende Uni
3 ECTS Gliederung B2 - Bachelor 2. Jahr Mathematik Peter Paule Johannes Kepler Universität Linz
Detailinformationen
Quellcurriculum Bachelorstudium Bioinformatics 2013W
Ziele (*)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.
Lehrinhalte (*)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.
Sonstige Informationen (*)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.
Untergeordnete Studienfächer, Module und Lehrveranstaltungen