Scheduling Lower Bounds via AND Subset Sum

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

doi:10.1016/j.jcss.2022.01.005

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Scheduling Lower Bounds via AND Subset Sum

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). Scheduling Lower Bounds via AND Subset Sum. Journal of Computer and System Sciences, 127, 29-40. doi:10.1016/j.jcss.2022.01.005.

Cite as: https://hdl.handle.net/21.11116/0000-000B-153C-B

Abstract

There is no abstract available