APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Le Gall, François, and 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.

MLA (9th ed.) Citation

Le Gall, François, and 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.