A simple near-linear pseudopolynomial time randomized algorithm for subset sum

DOI10.4230/oasics.sosa.2019.17zbMath1547.68841MaRDI QIDQ6593573

Ce Jin, Hongxun Wu

Publication date: 26 August 2024

zbMATH Keywords

FFTformal power seriessubset sum

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Combinatorial optimization (90C27) Randomized algorithms (68W20)

This page was built for publication: A simple near-linear pseudopolynomial time randomized algorithm for subset sum