Tight lower bounds for the Workflow Satisfiability Problem...

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

Gutin, Gregory, Wahlström, Magnus
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
116
Language:
english
Journal:
Information Processing Letters
DOI:
10.1016/j.ipl.2015.11.008
Date:
March, 2016
File:
PDF, 243 KB
english, 2016
Conversion to is in progress
Conversion to is failed