Le Gall, F. (2012), «Faster algorithms for rectangular matrix multiplication», Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514-523, S2CID2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80.
Anna R. Karlin; Nathan Klein; Shayan Oveis Gharan (2020-09-01). «A (Slightly) Improved Approximation Algorithm for Metric TSP». arXiv:2007.01409 [cs.DS].
Hutter, Marcus (2002-06-14). «The Fastest and Shortest Algorithm for All Well-Defined Problems». arXiv:cs/0206022.
Le Gall, F. (2012), «Faster algorithms for rectangular matrix multiplication», Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514-523, S2CID2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80.
Kawarabayashi, K. I.; Kobayashi, Y.; Reed, B. (2012). «The disjoint paths problem in quadratic time». Journal of Combinatorial Theory, Series B102 (2): 424-435. doi:10.1016/j.jctb.2011.07.004.
Johnson, David S. (1987). «The NP-completeness column: An ongoing guide (edition 19)». Journal of Algorithms8 (2): 285-303. doi:10.1016/0196-6774(87)90043-5. «citeseerx: 10.1.1.114.3864».
Liang, Faming, Yichen Cheng, and Guang Lin (2014). «Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule». Journal of the American Statistical Association109 (506): 847-863. S2CID123410795. doi:10.1080/01621459.2013.872993.
Ingber, Lester (1993). «Simulated annealing: Practice versus theory». Mathematical and Computer Modelling18 (11): 29-57. doi:10.1016/0895-7177(93)90204-C.
Lipton, Richard J., and Kenneth W. Regan (2013). «David Johnson: Galactic Algorithms». People, Problems, and Proofs. Heidelberg: Springer Berlin. pp. 109-112.
Le Gall, F. (2012), «Faster algorithms for rectangular matrix multiplication», Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514-523, S2CID2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80.
Liang, Faming, Yichen Cheng, and Guang Lin (2014). «Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule». Journal of the American Statistical Association109 (506): 847-863. S2CID123410795. doi:10.1080/01621459.2013.872993.
theconversation.com
«We've found a quicker way to multiply really big numbers». Cita, de uno de los autores del algoritmo: "El nuevo algoritmo no es realmente práctico en su forma actual, porque la prueba dada en nuestro artículo solo funciona para números ridículamente grandes. Incluso si cada dígito se escribiera en un átomo de hidrógeno, no habría suficiente espacio disponible en el universo observable para escribirlos."
