Information from The Mathematics Genealogy
Andrej Bogdanov obtained a Ph.D. degree in mathematics at University of California, Berkeley in 2005.
The title of the thesis was:
The Relation Between Worst Case and Average Case Complexity for NP.
The thesis supervisor was Luca Trevisan.
We are trying to provide information about past IMO contestants, and possibly, links to their current web sites. Since many of them became mathematicians,
The Mathematics Genealogy Project is our primary source of information on Ph.D. dissertations in mathematics.
If there are several mathematicians with the name Andrej Bogdanov we may have picked a wrong entry from the genealogy web site. When a different spelling of the name is used at Mathematics Genealogy, chances are that we have missed the information completely. We are correcting the mistakes as soon as we become aware of them, and any help is welcome.
If the information is not available on the Mathematics Genealogy Project, we are unlikely to have it.
We would appreciate if you help us by using the form below to create an entry about Andrej Bogdanov that would supplement or replace the content of the current page.
If you have some information about this IMO contestant, please create a page.
If you are able and willing to contribute, you are invited to help. You need to be logged in if you wish to contribute, but your username will not be publicly displayed with the pages you create or edit.
Recent updates: Matthijs Melissen, Jose Ernie C. Lope, Talbi Malik, Jonathan Weinstein, Hong Yu He.
| 
