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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 116; H. 3; S. 223 - 226
Hauptverfasser:	Gutin, Gregory, Wahlström, Magnus
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.03.2016 Elsevier Sequoia S.A
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!