TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (Q5249280)

From MaRDI portal
Revision as of 09:24, 13 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128392224, #quickstatements; #temporary_batch_1723507444692)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6432503
Language Label Description Also known as
English
TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS
scientific article; zbMATH DE number 6432503

    Statements

    TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (English)
    0 references
    0 references
    0 references
    30 April 2015
    0 references
    task-graph scheduling
    0 references
    strong sense NP-complete
    0 references
    deadline analysis
    0 references
    computational complexity
    0 references
    3-SAT
    0 references

    Identifiers

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