Jain, R., Klauck, H., Kundu, S., Lee, T., Santha, M., Sanyal, S., & Vihrovs, J. (2020). Quadratically Tight Relations for Randomized Query Complexity. Theory of computing systems, 64(1), 101-119. https://doi.org/10.1007/s00224-019-09935-x
Citace podle Chicago (17th ed.)Jain, Rahul, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, a Jevgēnijs Vihrovs. "Quadratically Tight Relations for Randomized Query Complexity." Theory of Computing Systems 64, no. 1 (2020): 101-119. https://doi.org/10.1007/s00224-019-09935-x.
Citace podle MLA (9th ed.)Jain, Rahul, et al. "Quadratically Tight Relations for Randomized Query Complexity." Theory of Computing Systems, vol. 64, no. 1, 2020, pp. 101-119, https://doi.org/10.1007/s00224-019-09935-x.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..