English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum

Bringmann, K., & Nakos, V. (2020). Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum. In K. Makarychev, Y. Makarychev, M. Tulsiani, G. Kamath, & J. Chuzhoy (Eds.), STOC '20 (pp. 982-995). New York, NY: ACM. doi:10.1145/3357713.3384308.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0007-299D-B Version Permalink: https://hdl.handle.net/21.11116/0000-000E-2212-7
Genre: Conference Paper
Latex : Top-$k$-convolution and the Quest for Near-linear Output-sensitive Subset Sum

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author                 
Nakos, Vasileios2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2020
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_STOC2020
DOI: 10.1145/3357713.3384308
 Degree: -

Event

show
hide
Title: 52nd Annual ACM SIGACT Symposium on Theory of Computing
Place of Event: Chicago, IL, USA
Start-/End Date: 2020-06-22 - 2020-06-26

Legal Case

show

Project information

show

Source 1

show
hide
Title: STOC '20
  Subtitle : Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
  Abbreviation : STOC 2020
Source Genre: Proceedings
 Creator(s):
Makarychev, Konstantin1, Editor
Makarychev, Yury1, Editor
Tulsiani, Madhur1, Editor
Kamath, Gautam1, Editor
Chuzhoy, Julia1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 982 - 995 Identifier: ISBN: 978-1-4503-6979-4