Citáce podľa APA (7th ed.)

Schawe, H., Bleim, R., & Hartmann, A. K. (2019). Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming. PloS one, 14(4), e0215309. https://doi.org/10.1371/journal.pone.0215309

Citácia podle Chicago (17th ed.)

Schawe, Hendrik, Roman Bleim, a Alexander K. Hartmann. "Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming." PloS One 14, no. 4 (2019): e0215309. https://doi.org/10.1371/journal.pone.0215309.

Citácia podľa MLA (8th ed.)

Schawe, Hendrik, et al. "Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming." PloS One, vol. 14, no. 4, 2019, p. e0215309, https://doi.org/10.1371/journal.pone.0215309.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..