The computational complexity of mixed discriminants

Alexander Barvinok
University of Michigan

I will discuss what is known about the computational complexity of the mixed discriminant of positive semidefinite matrices. There are some parallels with that of the permanent of non-negative matrices, but there are also some glaring differences.

Back to Workshop I: Expected Characteristic Polynomial Techniques and Applications