>You can say that the problem is an NP problem which disguises itself as a P problem. It would be really fun to use David Pisingers knapsack algorithm codes, http://www.diku.dk/hjemmesider/ansatte/pisinger/codes.html and then bait the bidder into finding a set for which the algorithm is NOT fast (hint: That is also pretty hard :)
This makes me think that the post could be a phish for programmers with strong maths comp-sci backgrounds, something Googlish?
That would be fun, but alas, I don't have time. One can simply submit Pisingers "decomp" codes from the page I linked above, but if you do that, you are not the author of the work...
This makes me think that the post could be a phish for programmers with strong maths comp-sci backgrounds, something Googlish?
Please someone try this!