English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

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.

Item is

Basic

show hide
Genre: Journal Article
Latex : {SETH}-Based Lower Bounds for {Subset Sum} and Bicriteria Path

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Abboud, Amir1, Author
Bringmann, Karl2, Author                 
Hermelin, Danny1, Author           
Shabtay, Dvir1, 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: 2022
 Publication Status: Published online
 Pages: 22 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Abboud22a
DOI: 10.1145/3450524
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: ACM Transactions on Algorithms
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: 18 (1) Sequence Number: 6 Start / End Page: 1 - 22 Identifier: ISSN: 1549-6325
CoNE: https://pure.mpg.de/cone/journals/resource/111088195282718