Fast and Simple Modular Subset Sum

Axiotis, Kyriakos; Backurs, Arturs; Bringmann, Karl; Jin, Ce; Nakos, Vasileios; Tzamos, Christos; Wu, Hongxun

doi:10.1137/1.9781611976496.6

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

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 Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

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. (2021). Fast and Simple Modular Subset Sum. In V. King, & H. Viet Le (Eds.), Symposium on Simplicity in Algorithms (pp. 57-67). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976496.6.

Cite as: https://hdl.handle.net/21.11116/0000-0007-56CF-0

Abstract

There is no abstract available