| Speaker: | Alexander Barvinok |
|---|---|
| Affiliation: | University of Michigan |
| Room: |
Mathematics & Computer Building (MC) 5158 |
| Speaker: | John Watrous |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics & Computer Building (MC) 5158 |
The interactive proof system model of computation is a cornerstone of computational complexity theory, and its quantum computational variant has been studied in quantum complexity theory for the past decade.
| Speaker: | Jim Geelen |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics & Computer Building (MC) 5158 |
Over the last 10 years I have been working with Bert Gerards and Geoff Whittle on trying to extend the graph minors project of Neil Robertson and Paul Seymour to matroids representable over a given finite fields.
| Speaker: | Boris Mordukhovich |
|---|---|
| Affiliation: | Wayne State University |
| Room: | Mathematics & Computer Building (MC) 5158 |
Variational analysis has been well recognized as a rapidly growing and fruitful area in mathematics motivated mainly by the study of constrained optimization and equilibrium problems, while also applying perturbation ideas and v
| Speaker: | Toh Kim Chuan |
|---|---|
| Affiliation: | National University of Singapore |
| Room: | Mathematics & Computer Building (MC) 5158 |
Semidefinite programming (SDP) problems are linear optimization problems over the set of positive semidefinite symmetric matrices.
| Speaker: | Konstantinos Georgiou |
|---|---|
| Affiliation: | University of Toronto |
| Room: | Mathematics & Computer Building (MC) 5158 |
A vertex cover of a graph is a subset of the vertices touching all the edges.
| Speaker: | Victoria Powers |
|---|---|
| Affiliation: | Emory University |
| Room: | Mathematics & Computer Building (MC) 5158 |
Let R[X] := R[X1,…,Xn].
| Speaker: | Bill Cunningham |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics & Computer Building (MC) 5158 |
The split decomposition of undirected graphs (also called join decomposition) has a number of nice applications. There are also attractive results on unique decomposition and on the structure of indecomposable graphs, and efficient decomposition algorithms.
| Speaker: | Yuri Faenza |
|---|---|
| Affiliation: | Università di Roma "Tor Vergata" |
| Room: | Mathematics & Computer Building (MC) 5158 |
A strip is a triple (G,a,b), where G is a simple, undirected graph and a,b are vertices of G whose neighborhood is a clique. The composition of strips takes as input a set of strips, and outputs a graph.
| Speaker: | Antoine Deza |
|---|---|
| Affiliation: | McMaster University |
| Room: | Mathematics & Computer Building (MC) 5158 |
The simplex and primal-dual interior point methods are currently the most computationally successful algorithms for linear optimization.