I'm writing about the Merkle-Hellman-Cryptosystem in my thesis, this uses subset-sum-problems (SSP) with super increasing sequences. The SSP is NP-complete, but the SSP consisting of super increasing sequences is easy to solve with the following algorithm.
However my question is, what compexity the algorithm has? I found this algorithm on page 300 here but there is no specification (like O(n^3)) or something, just Algorithm 8.35 efficiently solves the subset sum problem for superincreasing sequences.. Do any of you know of a source where this is addressed? I need a source for my thesis, if it's possible...
Thanks