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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.