The Computational Complexity of Immanants

By Peter Bürgisser. 2000

33 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Determinantal Point Processes for Machine Learning (2012, background): “Complexity results for immanants are less definitive, with certain classes of immanants apparently hard to compute [19, 20], while some upper bounds on complexity are known [5, 65], and at least one nontrivial case is efficiently computable [62].”
Complexity and Completeness of Immanants (2003, methodology): “Bürgisser’s main result in [1] is the proof of his conjecture for two types of families of partitions, one where the shapes were all hooks (n− i, 1i), and the other where the shapes were all rectangles (ms).”