Publisher
Springer Nature Switzerland
Reference19 articles.
1. Aaronson, S.: My AI Safety Lecture for UT Effective Altruism (2022). https://scottaaronson.blog/?p=6823. Accessed May 2023
2. Agrawal, S., Saha, S., Schwartzbach, N.I., Vanukuri, A., Vasudevan, P.N.: $$k$$-sum in the sparse regime. Cryptology ePrint Archive, Paper 2023/488 (2023). https://eprint.iacr.org/2023/488
3. Lecture Notes in Computer Science;L von Ahn,2004
4. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, USA, 11–14 October 2003, pp. 298–307. IEEE Computer Society (2003). https://doi.org/10.1109/SFCS.2003.1238204
5. Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory 38(2), 509–516 (1992). https://doi.org/10.1109/18.119713