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
Citace podle Chicago (17th ed.)Gutin, Gregory, a 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.
Citace podle MLA (9th ed.)Gutin, Gregory, a 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.