Past Member
Robert Robere
Funding provided by the Charles Simonyi Endowment
From
–
Robert Robere is working on computational complexity theory, which is the study of computational resources (such as running time or memory) and their use in solving computational problems. He is particularly interested in proving lower bounds in circuit complexity, proof complexity, and related topics.
Visits
Member
School of Mathematics
–
Visitor
School of Mathematics
–
Spring
Degrees
University of Toronto
Ph.D.
2018
University of Toronto
M.Sc.
2013
Memorial University of Newfoundland
B.Sc.
2012