An efficient tree decomposition method for permanents and mixed discriminants (Q905704)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient tree decomposition method for permanents and mixed discriminants |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient tree decomposition method for permanents and mixed discriminants |
scientific article |
Statements
An efficient tree decomposition method for permanents and mixed discriminants (English)
0 references
28 January 2016
0 references
In this paper the authors present an algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices, and tensors. Some illustrations are provided. The algorithm is largely based on the concept of treewidth and tree decompositions.
0 references
permanent
0 references
structured array
0 references
mixed discriminant
0 references
treewidth
0 references
hyperdeterminant
0 references
0 references
0 references
0 references
0 references
0.7963137626647949
0 references
0.7897053956985474
0 references
0.7847036123275757
0 references
0.7801848649978638
0 references
0.7778691649436951
0 references
