Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

@article{Gutin2016TightLB,
  title={Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis},
  author={Gregory Gutin and Magnus Wahlstr{\"o}m},
  journal={ArXiv},
  year={2016},
  volume={abs/1508.06829}
}
  • Gregory Gutin, Magnus Wahlström
  • Published 2016
  • Mathematics, Computer Science
  • ArXiv
  • The Workflow Satisfiability Problem (WSP) is a problem used in access control.The WSP is parameterized by the number of steps.The WSP is considered for regular and user-independent constraints.Tight lower bounds are proved for WSP algorithms with the two types of constraints. The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES

    Satisfiability and Resiliency in Workflow Authorization Systems

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    On the Complexity of k-SAT

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Parameterized Algorithms

    Valued Workflow Satisfiability Problem

    VIEW 2 EXCERPTS