A note on some upper bounds for permanents of (0, 1)-matrices (Q3622685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import recommendations run Q6534273
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720502.2009.10700615 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989753634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds for permanents of (0, 1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the permanent of \((0,1)\)-matrices. / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: An algorithmic proof of Brégman–Minc theorem / rank
 
Normal rank
Property / Recommended article: An algorithmic proof of Brégman–Minc theorem / qualifier
 
Similarity Score: 0.81845295
Amount0.81845295
Unit1
Property / Recommended article: An algorithmic proof of Brégman–Minc theorem / qualifier
 
Property / Recommended article
 
Property / Recommended article: New permanental upper bounds for nonnegative matrices / rank
 
Normal rank
Property / Recommended article: New permanental upper bounds for nonnegative matrices / qualifier
 
Similarity Score: 0.8038019
Amount0.8038019
Unit1
Property / Recommended article: New permanental upper bounds for nonnegative matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Some upper bounds for permanents of (0, 1)-matrices / rank
 
Normal rank
Property / Recommended article: Some upper bounds for permanents of (0, 1)-matrices / qualifier
 
Similarity Score: 0.780766
Amount0.780766
Unit1
Property / Recommended article: Some upper bounds for permanents of (0, 1)-matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Permanental bounds for nonnegative matrices via decomposition / rank
 
Normal rank
Property / Recommended article: Permanental bounds for nonnegative matrices via decomposition / qualifier
 
Similarity Score: 0.77479064
Amount0.77479064
Unit1
Property / Recommended article: Permanental bounds for nonnegative matrices via decomposition / qualifier
 
Property / Recommended article
 
Property / Recommended article: An upper bound for the permanent of \((0,1)\)-matrices. / rank
 
Normal rank
Property / Recommended article: An upper bound for the permanent of \((0,1)\)-matrices. / qualifier
 
Similarity Score: 0.77263755
Amount0.77263755
Unit1
Property / Recommended article: An upper bound for the permanent of \((0,1)\)-matrices. / qualifier
 
Property / Recommended article
 
Property / Recommended article: Singularity of sparse random matrices: simple proofs / rank
 
Normal rank
Property / Recommended article: Singularity of sparse random matrices: simple proofs / qualifier
 
Similarity Score: 0.76428276
Amount0.76428276
Unit1
Property / Recommended article: Singularity of sparse random matrices: simple proofs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Permanents of doubly stochastic matrices / rank
 
Normal rank
Property / Recommended article: Permanents of doubly stochastic matrices / qualifier
 
Similarity Score: 0.749122
Amount0.749122
Unit1
Property / Recommended article: Permanents of doubly stochastic matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: An upper bound for permanents of nonnegative matrices / rank
 
Normal rank
Property / Recommended article: An upper bound for permanents of nonnegative matrices / qualifier
 
Similarity Score: 0.74102694
Amount0.74102694
Unit1
Property / Recommended article: An upper bound for permanents of nonnegative matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Maximum determinant and permanent of sparse 0-1 matrices / rank
 
Normal rank
Property / Recommended article: Maximum determinant and permanent of sparse 0-1 matrices / qualifier
 
Similarity Score: 0.73400027
Amount0.73400027
Unit1
Property / Recommended article: Maximum determinant and permanent of sparse 0-1 matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computing sparse approximations deterministically / rank
 
Normal rank
Property / Recommended article: Computing sparse approximations deterministically / qualifier
 
Similarity Score: 0.73158675
Amount0.73158675
Unit1
Property / Recommended article: Computing sparse approximations deterministically / qualifier
 
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:54, 27 January 2025

scientific article
Language Label Description Also known as
English
A note on some upper bounds for permanents of (0, 1)-matrices
scientific article

    Statements

    A note on some upper bounds for permanents of (0, 1)-matrices (English)
    0 references
    0 references
    28 April 2009
    0 references
    permanent
    0 references
    systems of distinct representatives
    0 references
    \((0,1)\)-matrix
    0 references
    Minc-Brégman bound
    0 references
    random sparse matrices
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references