Gutin, G., Kratsch, S., & Wahlström, M. (2016). Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica, 75(2), 383-402. https://doi.org/10.1007/s00453-015-9986-9
Chicago Style (17th ed.) CitationGutin, Gregory, Stefan Kratsch, and Magnus Wahlström. "Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem." Algorithmica 75, no. 2 (2016): 383-402. https://doi.org/10.1007/s00453-015-9986-9.
MLA (9th ed.) CitationGutin, Gregory, et al. "Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem." Algorithmica, vol. 75, no. 2, 2016, pp. 383-402, https://doi.org/10.1007/s00453-015-9986-9.
Warning: These citations may not always be 100% accurate.