SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir

doi:10.1145/3450524

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_3407670_3

DetailsSummary

Released

Journal Article

SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

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): 6, pp. 1-22. doi:10.1145/3450524.

Cite as: https://hdl.handle.net/21.11116/0000-000B-1543-2

Abstract

There is no abstract available