Golovnev, A., Kulikov, A. S., & Mihajlin, I. (2014). Solving SCS for bounded length strings in fewer than 2n steps. Information processing letters, 114(8), 421-425. https://doi.org/10.1016/j.ipl.2014.03.004
Citácia podle Chicago (17th ed.)Golovnev, Alexander, Alexander S. Kulikov, a Ivan Mihajlin. "Solving SCS for Bounded Length Strings in Fewer than 2n Steps." Information Processing Letters 114, no. 8 (2014): 421-425. https://doi.org/10.1016/j.ipl.2014.03.004.
Citácia podľa MLA (8th ed.)Golovnev, Alexander, et al. "Solving SCS for Bounded Length Strings in Fewer than 2n Steps." Information Processing Letters, vol. 114, no. 8, 2014, pp. 421-425, https://doi.org/10.1016/j.ipl.2014.03.004.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..