Efficient computation of the permanent of a sparse matrix (Q2740952): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Ramesh Chand Mittal / rank | |||
Property / author | |||
Property / author: Ramesh Chand Mittal / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/00207160108805061 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2081219400 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A permanent formula with many zero-valued terms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5632589 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851094 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the permanent value problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:46, 3 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient computation of the permanent of a sparse matrix |
scientific article |
Statements
Efficient computation of the permanent of a sparse matrix (English)
0 references
10 March 2002
0 references
sparse matrix
0 references
numerical examples
0 references
permanent
0 references
\((0,1)\)-matrices
0 references
tree theory
0 references