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

• Published in: Information processing letters Vol. 116; no. 3; pp. 223 - 226
• Main Authors: Gutin, Gregory, Wahlström, Magnus
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.03.2016; Elsevier Sequoia S.A
• Subjects: Algorithms; Computational complexity; Computer science; Constraint satisfaction; Fixed-parameter tractable; Hypotheses; Strong Exponential Time Hypothesis; Studies; Workflow Satisfiability Problem; Workflow software; Constraint satisfaction; Fixed-parameter tractable; Workflow Satisfiability Problem; Strong Exponential Time Hypothesis; Computational complexity
• ISSN: 0020-0190; 1872-6119
• DOI: 10.1016/j.ipl.2015.11.008

•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 when restricted to just not equal constraints. Since the number of steps k is relatively small in practice, Wang and Li (2010) [21] introduced a parametrisation of WSP by k. Wang and Li (2010) [21] showed that, in general, the WSP is W[1]-hard, i.e., it is unlikely that there exists a fixed-parameter tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) [10] and Cohen et al. (2014) [6] designed FPT algorithms of running time O⁎(2k) and O⁎(2klog2⁡k) for the WSP with so-called regular and user-independent constraints, respectively. In this note, we show that there are no algorithms of running time O⁎(2ck) and O⁎(2cklog2⁡k) for the two restrictions of WSP, respectively, with any c<1, unless the Strong Exponential Time Hypothesis fails.