Valentine Kabanets headshot
Past von Neumann Fellow

Valentine Kabanets

Funding provided by the National Science Foundation

Affiliation

Mathematics

Field of Study

Computational complexity

Home Institution

Simon Fraser University
From
-

The proposed research is to study a number of complexity problems, especially those related to the role of randomness in computation. The big motivating questions are "BPP versus NEXP" and "RL versus L". The plan is also to work on explicit constructions of various "random-looking" combinatorial objects, both in terms of finding new constructions, and applying them to get interesting complexity theory results.

Dates at IAS

von Neumann Fellow
School of Mathematics
Member
School of Mathematics

Degrees

University of Toronto, Canada
Ph.D.
2000