Astraios Courses1922
hasCourse

Design and analysis of algorithms  

Description

Description: fast Fourier transform (FFT), fast multiplication of polynomials using FFT, effective algorithm for calculating the maximal flow in the network, maximal flow. Learning outcomes After completing this course, the student will be able: * to use various algorithmic techniques and concepts, such as fast Fourier transform, maximum flow in the networks, linear-programming, approximation algorithm techniques * to be able to analyze the time complexity of the algorithms, to prove their correctness, and to show approximation factor (for approximation algorithms) * to read and understand medium-difficulty mathematical and computer science texts in the area; * to develop appropriate algorithms for a variety of applied problems, to analyze their performance and prove their correctness

Delivery mode

Presential
English

Name

Design and analysis of algorithms
English

UNIVERSITY OF TWENTE

Faculty of Geo-Information Science and Earth Observation

Astraios home page

Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or HaDEA. Neither the European Union nor the granting authority can be held responsible for them. The statements made herein do not necessarily have the consent or agreement of the ASTRAIOS Consortium. These represent the opinion and findings of the author(s).