SETH-based Lower Bounds for Subset Sum and Bicriteria Path

DOI10.1145/3450524OpenAlexW4207048092MaRDI QIDQ6058234

Karl Bringmann, Amir Abboud, Dvir Shabtay, Danny Hermelin

Publication date: 31 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/21.11116/0000-0002-9E17-3

zbMATH Keywords

subset sumbicriteria shortest pathstrong exponential time hypothesisfine-grained complexity

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: SETH-based Lower Bounds for Subset Sum and Bicriteria Path