PhD Defence • Algorithms and Complexity • Complexity of Sublinear Algorithms for Convexity in Higher Dimensions
Please note: This PhD defence will take place online.
Venkata Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Convexity plays a prominent role in both mathematics and computer science. It is defined for sets and functions, and many problems related to them can be solved efficiently given the guarantee that the set/function is convex. In this thesis, we focus on three problems related to convexity where we don’t have that guarantee.