Bipartite perfect matching is in quasi-NC (Q5361877)

From MaRDI portal
Revision as of 01:27, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Bipartite perfect matching is in quasi-NC (English)
    0 references
    author
    Rohit Gurjar
    0 references
    Stephen A. Fenner
    0 references
    Thomas Thierauf
    0 references
    publication date
    29 September 2017
    0 references
    zbMATH Keywords
    derandomization
    0 references
    graph matching
    0 references
    parallel complexity
    0 references
    quasi-NC
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C70
    0 references
    68W10
    0 references
    68W20
    0 references
    zbMATH DE Number
    6784116
    0 references
    OpenAlex ID
    W2399980850
    0 references
    arXiv ID
    1601.06319
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5361877&oldid=33750803"
    Powered by MediaWiki