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
Citace podle Chicago (17th ed.)Gutin, Gregory, Stefan Kratsch, a 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.
Citace podle MLA (9th ed.)Gutin, 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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..