APA (7th ed.) Citation

Gutin, G., & Wahlström, M. (2016). Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Information processing letters, 116(3), 223-226. https://doi.org/10.1016/j.ipl.2015.11.008

Chicago Style (17th ed.) Citation

Gutin, Gregory, and Magnus Wahlström. "Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis." Information Processing Letters 116, no. 3 (2016): 223-226. https://doi.org/10.1016/j.ipl.2015.11.008.

MLA (9th ed.) Citation

Gutin, Gregory, and Magnus Wahlström. "Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis." Information Processing Letters, vol. 116, no. 3, 2016, pp. 223-226, https://doi.org/10.1016/j.ipl.2015.11.008.