Le Gall, F., & Seddighin, S. (2023). Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. Algorithmica, 85(5), 1251-1286. https://doi.org/10.1007/s00453-022-01066-z
Citace podle Chicago (17th ed.)Le Gall, François, a Saeed Seddighin. "Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems." Algorithmica 85, no. 5 (2023): 1251-1286. https://doi.org/10.1007/s00453-022-01066-z.
Citace podle MLA (9th ed.)Le Gall, François, a Saeed Seddighin. "Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems." Algorithmica, vol. 85, no. 5, 2023, pp. 1251-1286, https://doi.org/10.1007/s00453-022-01066-z.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..