Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir SETH-based lower bounds for subset sum and bicriteria path. (English) Zbl 1431.68040 Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 41-57 (2019). Cited in 3 Documents MSC: 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) Citations:Zbl 0135.20506; Zbl 1423.90210 PDF BibTeX XML Cite \textit{A. Abboud} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 41--57 (2019; Zbl 1431.68040) Full Text: DOI arXiv OpenURL