APA (7th ed.) Citation

Abboud, A., Bringmann, K., Hermelin, D., & Shabtay, D. (2022). SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ACM transactions on algorithms, 18(1), 1-22. https://doi.org/10.1145/3450524

Chicago Style (17th ed.) Citation

Abboud, Amir, Karl Bringmann, Danny Hermelin, and Dvir Shabtay. "SETH-based Lower Bounds for Subset Sum and Bicriteria Path." ACM Transactions on Algorithms 18, no. 1 (2022): 1-22. https://doi.org/10.1145/3450524.

MLA (9th ed.) Citation

Abboud, Amir, et al. "SETH-based Lower Bounds for Subset Sum and Bicriteria Path." ACM Transactions on Algorithms, vol. 18, no. 1, 2022, pp. 1-22, https://doi.org/10.1145/3450524.