✦ LIBER ✦

The Computational Complexity of Immanants

✍ Scribed by Bürgisser, Peter

Book ID: 118177571
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 231 KB
Volume: 30
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539798367880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of immanents an

Computational complexity of immanents and representations of the full linear group

✍ A. I. Barvinok 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 181 KB

The stabilizer of immanants

✍ Ke Ye 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 265 KB

The Computational Complexity of Sandpile

The Computational Complexity of Sandpiles

✍ Cristopher Moore; Martin Nilsson 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 235 KB

Degrees of computational complexity

✍ H.B. Enderton 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the

Computational complexity of functions

✍ Leonid A. Levin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 330 KB

The Computational Complexity of Weak Sad

The Computational Complexity of Weak Saddles

✍ Felix Brandt; Markus Brill; Felix Fischer; Jan Hoffmann 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 760 KB