A Unified Theorem on Semidefinite Programming Rank Reduction and its ApplicationsSpeaker: Yinyu Ye Affiliation: Stanford University Room: Mathematics & Computer Building (MC) 5158
From the stable set problem to convex algebraic geometrySpeaker: Pablo Parrilo Affiliation: MIT Room: Mathematics & Computer Building (MC) 5158
Increasing connectivity of a graph from 1 to 2Speaker: Guy Kortsarz Affiliation: Rutgers University Room: Mathematics & Computer Building (MC) 5158
Given an unweighted graph G(V,E) and a set F\subseteq V\times V the goal is to find a minimum SIZE F'\subset F such that G(V,E+F') is 2 edge-connected, namely, every edge lies in a cycle in G(V,E+F').
Pairing-friendly elliptic curves with variable CM discriminantSpeaker: Edlyn Teske Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office.