Hartarsky, I., & Mezei, T. R. (2019, November 30). Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness. arXiv.org. https://doi.org/10.48550/arxiv.1809.01525
Citace podle Chicago (17th ed.)Hartarsky, Ivailo, a Tamás Róbert Mezei. "Complexity of 2D Bootstrap Percolation Difficulty: Algorithm and NP-hardness." ArXiv.org 30 Nov. 2019. https://doi.org/10.48550/arxiv.1809.01525.
Citace podle MLA (9th ed.)Hartarsky, Ivailo, a Tamás Róbert Mezei. "Complexity of 2D Bootstrap Percolation Difficulty: Algorithm and NP-hardness." ArXiv.org, 30 Nov. 2019, https://doi.org/10.48550/arxiv.1809.01525.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..