@incollection{Karp1972,
  author = {Richard M. Karp},
  title = {Reducibility among Combinatorial Problems},
  booktitle = {Complexity of Computer Computations},
  editor = {Raymond E. Miller and James W. Thatcher and Jean D. Bohlinger},
  publisher = {Plenum Press},
  pages = {85--103},
  year = {1972},
  doi = {10.1007/978-1-4684-2001-2_9}
}

@article{HorowitzSahni1974,
  author = {Ellis Horowitz and Sartaj Sahni},
  title = {Computing Partitions with Applications to the Knapsack Problem},
  journal = {Journal of the ACM},
  volume = {21},
  number = {2},
  pages = {277--292},
  year = {1974},
  doi = {10.1145/321812.321823}
}

@article{SchroeppelShamir1981,
  author = {Richard Schroeppel and Adi Shamir},
  title = {A {$T=O(2^{n/2})$}, {$S=O(2^{n/4})$} Algorithm for Certain {NP}-Complete Problems},
  journal = {SIAM Journal on Computing},
  volume = {10},
  number = {3},
  pages = {456--464},
  year = {1981},
  doi = {10.1137/0210033}
}

@inproceedings{CJRS2023,
  author = {Xi Chen and Yaonan Jin and Tim Randolph and Rocco A. Servedio},
  title = {{Subset Sum} in Time {$2^{n/2}/\operatorname{poly}(n)$}},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {275},
  pages = {39:1--39:18},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2023},
  doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.39}
}

@book{Bellman1957,
  author = {Richard Bellman},
  title = {Dynamic Programming},
  publisher = {Princeton University Press},
  year = {1957}
}

@inproceedings{KoiliarisXu2017,
  author = {Konstantinos Koiliaris and Chao Xu},
  title = {A Faster Pseudopolynomial Time Algorithm for {Subset Sum}},
  booktitle = {Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {1062--1072},
  publisher = {SIAM},
  year = {2017},
  doi = {10.1137/1.9781611974782.68}
}

@inproceedings{Bringmann2017,
  author = {Karl Bringmann},
  title = {A Near-Linear Pseudopolynomial Time Algorithm for {Subset Sum}},
  booktitle = {Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {1073--1084},
  publisher = {SIAM},
  year = {2017},
  doi = {10.1137/1.9781611974782.69}
}

@inproceedings{Chan2026,
  author = {Timothy M. Chan},
  title = {Derandomizing Pseudopolynomial Algorithms for {Subset Sum}},
  booktitle = {Proceedings of the 37th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {3600--3610},
  publisher = {SIAM},
  year = {2026},
  doi = {10.1137/1.9781611978971.131}
}

@inproceedings{MVV1987,
  author = {Ketan Mulmuley and Umesh V. Vazirani and Vijay V. Vazirani},
  title = {Matching is as Easy as Matrix Inversion},
  booktitle = {Proceedings of the 19th Annual ACM Symposium on Theory of Computing},
  pages = {345--354},
  publisher = {ACM},
  year = {1987},
  doi = {10.1145/28395.383347}
}

@inproceedings{HGJ2010,
  author = {Nick Howgrave-Graham and Antoine Joux},
  title = {New Generic Algorithms for Hard Knapsacks},
  booktitle = {Advances in Cryptology--EUROCRYPT 2010},
  series = {Lecture Notes in Computer Science},
  volume = {6110},
  pages = {235--256},
  publisher = {Springer},
  year = {2010},
  doi = {10.1007/978-3-642-13190-5_12}
}

@inproceedings{BCJ2011,
  author = {Anja Becker and Jean-S{\'e}bastien Coron and Antoine Joux},
  title = {Improved Generic Algorithms for Hard Knapsacks},
  booktitle = {Advances in Cryptology--EUROCRYPT 2011},
  series = {Lecture Notes in Computer Science},
  volume = {6632},
  pages = {364--385},
  publisher = {Springer},
  year = {2011},
  doi = {10.1007/978-3-642-20465-4_21}
}

@inproceedings{AKKN2016,
  author = {Per Austrin and Petteri Kaski and Mikko Koivisto and Jesper Nederlof},
  title = {Dense {Subset Sum} May Be the Hardest},
  booktitle = {33rd Symposium on Theoretical Aspects of Computer Science},
  series = {Leibniz International Proceedings in Informatics},
  volume = {47},
  pages = {13:1--13:14},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2016},
  doi = {10.4230/LIPIcs.STACS.2016.13}
}

@inproceedings{NederlofWegrzycki2021,
  author = {Jesper Nederlof and Karol W{\k{e}}grzycki},
  title = {Improving {Schroeppel} and {Shamir}'s Algorithm for {Subset Sum} via Orthogonal Vectors},
  booktitle = {Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing},
  pages = {1670--1683},
  publisher = {ACM},
  year = {2021},
  doi = {10.1145/3406325.3451024}
}

@inproceedings{RandolphWegrzycki2026,
  author = {Tim Randolph and Karol W{\k{e}}grzycki},
  title = {Beating Meet-in-the-Middle for Subset Balancing Problems},
  booktitle = {Proceedings of the 58th Annual ACM Symposium on Theory of Computing},
  pages = {1314--1325},
  publisher = {ACM},
  year = {2026},
  doi = {10.1145/3798129.3800841}
}

@article{RosserSchoenfeld1962,
  author = {J. Barkley Rosser and Lowell Schoenfeld},
  title = {Approximate Formulas for Some Functions of Prime Numbers},
  journal = {Illinois Journal of Mathematics},
  volume = {6},
  number = {1},
  pages = {64--94},
  year = {1962},
  doi = {10.1215/ijm/1255631807}
}

@inproceedings{Christiani2017,
  author = {Tobias Christiani},
  title = {A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering},
  booktitle = {Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {31--46},
  publisher = {SIAM},
  year = {2017},
  doi = {10.1137/1.9781611974782.3}
}

@article{KLM1989,
  author = {Richard M. Karp and Michael Luby and Neal Madras},
  title = {{Monte-Carlo} Approximation Algorithms for Enumeration Problems},
  journal = {Journal of Algorithms},
  volume = {10},
  number = {3},
  pages = {429--448},
  year = {1989},
  doi = {10.1016/0196-6774(89)90038-2}
}

@article{TrefethenWeideman2014,
  author = {Lloyd N. Trefethen and J. A. C. Weideman},
  title = {The Exponentially Convergent Trapezoidal Rule},
  journal = {SIAM Review},
  volume = {56},
  number = {3},
  pages = {385--458},
  year = {2014},
  doi = {10.1137/130932132}
}