Pseudorandomness and explicit constructions in dis.. (PaECiDM)
Pseudorandomness and explicit constructions in discrete mathematics
Start date: Sep 1, 2014,
End date: Aug 31, 2016
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.
Get Access to the 1st Network for European Cooperation