Khartov, A. (2016). A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications. Journal of Complexity, 34, 30-41. https://doi.org/10.1016/j.jco.2015.11.004
Citace podle Chicago (17th ed.)Khartov, A.A. "A Simplified Criterion for Quasi-polynomial Tractability of Approximation of Random Elements and Its Applications." Journal of Complexity 34 (2016): 30-41. https://doi.org/10.1016/j.jco.2015.11.004.
Citace podle MLA (9th ed.)Khartov, A.A. "A Simplified Criterion for Quasi-polynomial Tractability of Approximation of Random Elements and Its Applications." Journal of Complexity, vol. 34, 2016, pp. 30-41, https://doi.org/10.1016/j.jco.2015.11.004.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..