Bipartite perfect matching is in quasi-NC (Q5361877): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Stephen A. Fenner / rank
Normal rank
 
Property / author
 
Property / author: Thomas Thierauf / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Fenner / rank
 
Normal rank
Property / author
 
Property / author: Thomas Thierauf / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2399980850 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.06319 / rank
 
Normal rank

Latest revision as of 01:27, 20 April 2024

scientific article; zbMATH DE number 6784116
Language Label Description Also known as
English
Bipartite perfect matching is in quasi-NC
scientific article; zbMATH DE number 6784116

    Statements

    Bipartite perfect matching is in quasi-NC (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    derandomization
    0 references
    graph matching
    0 references
    parallel complexity
    0 references
    quasi-NC
    0 references

    Identifiers

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