algorithm - Subset Sum with a list of 2675 numbers -


i looking yes/no answer question whether can solved efficiency or not. pretty sure that's impossible current state of computing technology available us. glad know wrong. here goes nothing.

i have list of 2576 numbers. trying find combination of numbers in list sums 44576.54. list of numbers contain numbers 5 digits (with 2 digit precision) 8 digits(with 2 digits precision).

i grateful help!

you're wrong. classical dynamic programming algorithm make quick work of problem on modern computing hardware.


Comments

Popular posts from this blog

asynchronous - C# WinSCP .NET assembly: How to upload multiple files asynchronously -

aws api gateway - SerializationException in posting new Records via Dynamodb Proxy Service in API -

asp.net - Problems sending emails from forum -