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

•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 Satisf...

Full description

Bibliographic Details

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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!