✦ LIBER ✦

Computational complexity of immanents and representations of the full linear group

✍ Scribed by A. I. Barvinok

Publisher: Springer US
Year: 1990
Tongue: English
Weight: 181 KB
Volume: 24
Category: Article
ISSN: 0016-2663
DOI: 10.1007/bf01077707

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of representations of the full l

A class of representations of the full linear group

✍ Russell Merris; Stephen Pierce 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Problems of combinatorial optimization,

Problems of combinatorial optimization, statistical sums and representations of the full linear group

✍ A. I. Barvinok 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 436 KB

The Computational Complexity of Some Pro

The Computational Complexity of Some Problems of Linear Algebra

✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

Some subgroups of the full linear group

✍ Z. I. Borevich 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 330 KB

On representations of the full linear gr

On representations of the full linear group and some of its subgroups over infinite fields of prime characteristic

✍ W. E. Jenner 📂 Article 📅 1957 🏛 Springer Vienna 🌐 English ⚖ 212 KB

On the computational complexity of piece

On the computational complexity of piecewise-linear homotopy algorithms

✍ Michael J. Todd 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 535 KB