On Near-Linear-Time Algorithms for Dense Subset Sum

Bringmann, Karl; Wellnitz, Philip

doi:10.1137/1.9781611976465.107

Local TagsRelease HistoryDetailsSummary

On Near-Linear-Time Algorithms for Dense Subset Sum

Bringmann, K., & Wellnitz, P. (2021). On Near-Linear-Time Algorithms for Dense Subset Sum. In D. Marx (Ed.), Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (pp. 1777-1796). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976465.107.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0007-8C7E-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-2235-0

Genre: Conference Paper

Latex : On Near-Linear-Time Algorithms for Dense {Subset Sum}

Files

show Files

Locators

show

Creators

hide

Creators:
Bringmann, Karl¹, Author
Wellnitz, Philip¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

hide

Language(s): eng - English

Dates: Accepted: 2020Published Online: 2021Date issued: 2021

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Bringmann_SODA21
DOI: 10.1137/1.9781611976465.107

Degree: -

Event

hide

Title: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms

Place of Event: Alexandria, VA, USA (Virtual Conference)

Start-/End Date: 2021-01-10 - 2021-01-13

Legal Case

show

Project information

show

Source 1

hide

Title: Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms

Abbreviation : SODA 2021

Source Genre: Proceedings

Creator(s):
Marx, Dániel¹, Editor

Affiliations:
1 External Organizations, ou_persistent22

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1777 - 1796 Identifier: ISBN: 978-1-61197-646-5