English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fast and Simple Modular Subset Sum

MPS-Authors
/persons/resource/persons44182

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

/persons/resource/persons251391

Nakos,  Vasileios
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

Axiotis, K., Backurs, A., Bringmann, K., Jin, C., Nakos, V., Tzamos, C., et al. (in press). Fast and Simple Modular Subset Sum. In SIAM Symposium on Simplicity in Algorithms (SOSA21).


Cite as: http://hdl.handle.net/21.11116/0000-0007-56CF-0
Abstract
There is no abstract available