English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum

Bringmann, K. (2017). A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1073-1084). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.69.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-5522-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-5523-2
Genre: Conference Paper

Files

show Files

Locators

show

Creators

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

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611974782.69
BibTex Citekey: DBLP:conf/soda/Bringmann17
 Degree: -

Event

show
hide
Title: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Barcelona, Spain
Start-/End Date: 2017-01-16 - 2017-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2017
  Subtitle : SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1073 - 1084 Identifier: -