Scheduling Lower Bounds via AND Subset Sum

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

doi:10.1016/j.jcss.2022.01.005

Local TagsRelease HistoryDetailsSummary

Scheduling Lower Bounds via AND Subset Sum

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000B-153C-B Version Permalink: https://hdl.handle.net/21.11116/0000-000E-21FC-1

Genre: Journal Article

Latex : Scheduling Lower Bounds via {AND} Subset Sum

Files

show Files

Locators

show

Creators

show

hide

Creators:
Abboud, Amir¹, Author
Bringmann, Karl², Author
Hermelin, Danny¹, Author
Shabtay, Dvir¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2022Date issued: 2022

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Abboud22
DOI: 10.1016/j.jcss.2022.01.005

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Computer and System Sciences

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 127 Sequence Number: - Start / End Page: 29 - 40 Identifier: ISSN: 0022-0000
CoNE: https://pure.mpg.de/cone/journals/resource/954922645032