English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  On Near-Linear-Time Algorithms for Dense Subset Sum

Bringmann, K., & Wellnitz, P. (in press). On Near-Linear-Time Algorithms for Dense Subset Sum. In Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: SIAM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0007-8C7E-F Version Permalink: https://hdl.handle.net/21.11116/0000-0007-8C83-7
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Wellnitz, Philip1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2020
 Publication Status: Accepted / In Press
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_SODA21
 Degree: -

Event

show
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

show
hide
Title: Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2021
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -