Veranstaltungskalender
Deterministic constructions of point sets with small dispersion
Referent: Dr. Mario Ullrich, Universität Linz, Österreich
Based on deep results from coding theory, we present a deterministic algorithm that constructs a point set with dispersion, i.e., the volume of the largest empty box, at most $\varepsilon$ in dimension $d$ of size $poly(1/\varepsilon)*\log(d)$, which is optimal with respect to the dependence on $d$. The running time of the algorithms is, although super-exponential in $1/\varepsilon$, only polynomial in $d$.
Weitere Informationen
Zutritt | öffentlich |
Anmeldung | nicht erforderlich |
Veranstaltende | Fakultät für Informatik und Mathematik, Lehrstuhl Prof. Dr. Thomas Müller-Gronbach |
E-Mail (für Rückfragen) | alexandra.vogl@uni-passau.de |