Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
From MaRDI portal
Publication:5326549
DOI10.1007/978-3-642-39206-1_5zbMath1336.68320arXiv1303.0609OpenAlexW1480447816MaRDI QIDQ5326549
Jussi Määttä, Petteri Kaski, Per Austrin, Mikko Koivisto
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.0609
Related Items
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, New time-memory trade-offs for subset sum -- improving ISD in theory and practice, Unnamed Item, Efficient dissection of bicomposite problems with cryptanalytic applications, Unnamed Item, Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems