The Complexity of Immanants

By Peter Bürgisser. 2000

11 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].”
The Computational Complexity of Immanants (2000, methodology): “The statement for hook immanants generalizes a result by Hartmann [11], while the claim for rectangular immanants answers an open problem posed by Strassen [21, Problem 14.2].”
Complexity and Completeness of Immanants (2003, unknown): “(A special case was already used by Hartmann [6, proof of Lemma 2]).”