# Rafael Mendes de Oliveira

Department |
Computer Science |

Faculty Adviser |
Zeev Dvir |

Year of Study |
G5 |

Undergraduate Institution |
MIT |

Undergraduate Major |
Mathematics & Computer Science |

Personal Bio | I am originally from Brazil, where I grew up until coming to the US for my undergraduate education. I currently work in Complexity Theory here in Princeton. Outside of work, I am interested in nature, dancing and volleyball. |
---|---|

Fun Fact | I tend to speak really loudly! |

Research Keywords | Lower Bounds & Derandomization |

Research Pitch | I study Complexity Theory, which is the counterpart to algorithms. We are interested in proving that certain problems are hard for computers, that is, that there are no efficient algorithms to solve certain problems (the famous P vs NP question is a very good example). In my case, I work with algorithms that only use algebra, that is, only the operations +, -, x, and ÷. In this setting we try to show that to compute certain algebraic expressions are hard to compute. The field is very interesting, with many great ideas that influenced many areas of algorithm design and practical problems! |

Meet and Greet 10/12 | |

Meet and Greet 10/13 | No, I will not attend |

Meal for Mentoring 11/14 | No, I will not attend |

Meal for Mentoring 11/15 | Yes, I will attend |