Knapsack problem is called Weakly NP complete or pseudo-polynomial. Time complexity of solving it is - O(n*W) .The value of W is linear but the length of W is exponential - length in terms of bits. Pseudo polynomial means - running time is a polyno...
Software Engineer - who is learning and sharing new things every now and then, follow along!
I am a Software Engineer currently looking out for jobs around seattle, Washington.
Markdown supported · ⌘↵ to post
No responses yet.