Banach spaces, as complete normed vector spaces, form a central framework in modern functional analysis. Their rich geometric structure underpins much of the theoretical development in approximation ...

What algorithms should an air defense system work with? Particle swarm algorithms if there are ten targets to be hit. If there are more than ten targets, greedy algorithms work best. These findings ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

This course is compulsory on the BSc in Data Science and BSc in Mathematics with Data Science. This course is available on the BSc in Mathematics and Economics, BSc in Mathematics with Economics, BSc ...