Horowitz and Sahni (Subset Sum The Subset-Sum Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 10:3410:34, 15 February 2023‎ Admin talk contribs‎ 339 bytes +339‎ Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O({2}^{(n/{2})$}) (https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Horowitz_and_Sahni_(Subset_Sum_The_Subset-Sum_Problem)"