A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (Q5176030): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): conf/stoc/JerrumSV01, #quickstatements; #temporary_batch_1731530891435
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56806477 / 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.1145/380752.380877 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982027240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/stoc/JerrumSV01 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:34, 13 November 2024

scientific article; zbMATH DE number 6409771
Language Label Description Also known as
English
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
scientific article; zbMATH DE number 6409771

    Statements

    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (English)
    0 references
    0 references
    0 references
    0 references
    27 February 2015
    0 references

    Identifiers

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