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

Gregory Gutin, Magnus Wahlström. Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett., 116(3):223-226, 2016. [doi]

@article{GutinW16,
  title = {Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis},
  author = {Gregory Gutin and Magnus Wahlström},
  year = {2016},
  doi = {10.1016/j.ipl.2015.11.008},
  url = {http://dx.doi.org/10.1016/j.ipl.2015.11.008},
  researchr = {https://researchr.org/publication/GutinW16},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {116},
  number = {3},
  pages = {223-226},
}