An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1008652 |
Normalize DOI. |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.laa.2003.09.003 / rank | |||
Property / author | |||
Property / author: Feng-Shan Bai / 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.1016/j.laa.2003.09.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094555811 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4044717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permanents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating the permanent: A simple approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.LAA.2003.09.003 / rank | |||
Normal rank |
Latest revision as of 19:51, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound for the permanent of \((0,1)\)-matrices. |
scientific article |
Statements
An upper bound for the permanent of \((0,1)\)-matrices. (English)
0 references
14 January 2004
0 references
Permanent
0 references
(0,1)-matrix
0 references
Upper bound
0 references
Unbiased estimator
0 references