Notice
The Frobenius Problem and Its Generalizations
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
The classical but oddly little-known Frobenius problem from number theoryis the following: given a set of positive integers with greatest common divisorequal to 1, find the largest integer not representable as a non-negativeinteger linear combination of the set elements. This largest integer iscalled the Frobenius number. For example, the Frobenius number of 6, 9, and 20is 43.
In this talk I will survey some of the known results on this problem andits applications to computer science, and a new generalization of thisproblem to words (strings of symbols).
Thème
Documentation
Liens
Le but du colloquium est d’offrir une vision d’ensemble des recherches les plus actives et les plus prometteuses dans le domaine des Sciences et Technologies de l’Information et de la Communication (STIC). Nouveaux thèmes scientifiques
Support de présentation de la conférencenouveaux domaines d’application