Shubhangi Saraf, University of Toronto

Research

Algebraic complexity Arithmetic circuits complexity theory Derandomization Learning algorithms Lower bounds Polynomials

Latest funding

Arithmetic Circuits: Algorithms and Complexity
NSERC · 2022 · Principal investigator
$165,000

Arithmetic Circuits: Algorithms and Complexity

Principal investigatorNSERC2022Discovery Grants Program - Individual

Principal investigators: Saraf, Shubhangi

Keywords: arithmetic circuits; complexity theory; algebraic complexity; lower bounds; derandomization; learning algorithms; polynomials

$165,000

From CIHR, NSERC and SSHRC funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998, including their latest published competition results.

Write to this professor

A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.

Applying for

Mention their NSERC grant from 2022

Subject: Prospective PhD student: Algebraic complexity Dear Professor Saraf, My name is [your name], and I am a [your current degree or role] at [your institution]. I am applying for a PhD position starting in [term and year]. Your research on algebraic complexity connects closely to my own work on [your research topic]. [One or two sentences on what you did and what you learned.] I also saw your NSERC-funded project "Arithmetic Circuits: Algorithms and Complexity" (2022), and I would be glad to contribute to work in that direction. Are you accepting new PhD students for [term and year]? I have attached my CV and transcripts, and I would be glad to talk at a time that suits you. Thank you for your time. Kind regards, [your name]