Objectif
The project aims to investigate the pseudorandomness phenomenon in discrete mathematics. In particular, the aim of the fellow is to learn-through-research two topics at the frontier of mathematics and computer science: expander graphs (their explicit constructions, and applications in computational complexity), and explicit construction of Ramsey graphs.
The field combines algebraic, combinatorial, probabilistic methods, and concepts from theoretical computer science.
Champ scientifique
Thème(s)
Appel à propositions
FP7-PEOPLE-2013-IEF
Voir d’autres projets de cet appel
Régime de financement
MC-IEF - Intra-European Fellowships (IEF)Coordinateur
115 67 Praha
Tchéquie