English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On Near-Linear-Time Algorithms for Dense Subset Sum

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons229250

Wellnitz,  Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/21.11116/0000-0007-8C7E-F
Abstract
There is no abstract available