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

Celý popis

Podrobná bibliografie

Vydáno v:	Information processing letters Ročník 116; číslo 3; s. 223 - 226
Hlavní autoři:	Gutin, Gregory, Wahlström, Magnus
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.03.2016 Elsevier Sequoia S.A
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!