An efficient tree decomposition method for permanents and mixed discriminants
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as ω, is small. Our algorithm...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2018-04-23T17:01:52Z.
|
| Subjects: | |
| Online Access: | Get fulltext |