Master’s Thesis Presentation • Algorithms and Complexity • NP-hardness of Testing Equivalence to Sparse and Constant-support Polynomials
Please note: This master’s thesis presentation will take place in DC 2310 and online.
Omkar Baraskar, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Éric Schost, Rafael Oliveira