Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
https://drops.dagstuhl.de/opus/volltexte/2020/12411/ (Publisher version)
https://creativecommons.org/licenses/by/3.0/legalcode (Copyright transfer agreement)
Abboud, A., Bringmann, K., Hermelin, D., & Shabtay, D. (2020). Scheduling Lower Bounds via AND Subset Sum. In A. Czumaj, A. Dawa, & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2020.4.