Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis
scientific article

    Statements

    Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (English)
    0 references
    0 references
    0 references
    5 January 2016
    0 references
    workflow satisfiability problem
    0 references
    strong exponential time hypothesis
    0 references
    fixed-parameter tractable
    0 references
    constraint satisfaction
    0 references
    computational complexity
    0 references

    Identifiers