Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. / Gutin, Gregory; Wahlstrom, Magnus.
In: Information Processing Letters, Vol. 116, No. 3, 03.2016, p. 223-226.Research output: Contribution to journal › Article › peer-review
Accepted author manuscript, 305 KB, PDF document
Licence: CC BY-NC-ND Show licence
Final published version
Original language | English |
---|---|
Pages (from-to) | 223-226 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 116 |
Issue number | 3 |
Early online date | 1 Dec 2015 |
DOIs | |
Publication status | Published - Mar 2016 |
ID: 25580755