The Two-Processor Scheduling Problem is in Random NC (Q3034827)

From MaRDI portal
Revision as of 20:24, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Two-Processor Scheduling Problem is in Random NC
scientific article

    Statements

    title
    The Two-Processor Scheduling Problem is in Random NC (English)
    0 references
    DOI
    10.1137/0218076
    0 references
    author
    Umesh V. Vazirani
    0 references
    Vijay V. Vazirani
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R99
    0 references
    68M20
    0 references
    68R10
    0 references
    zbMATH DE Number
    4133504
    0 references
    zbMATH Keywords
    matching
    0 references
    randomized algorithms
    0 references
    basis of a matrix
    0 references
    parallel algorithm
    0 references
    two-processor scheduling problem
    0 references
    OpenAlex ID
    W1981314573
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3034827&oldid=31532319"
    Powered by MediaWiki