I solved the subset sum problem in polynomial time
I solved the subset sum problem in polynomial time
https://pastebin.com/j6bqLn8E I think I solved the subset sum problem, a NP-Complete problem. I compared the output of smaller sets to existing algorithms and the results match. Obviously, I cant compare larger sets due to the time complexity of existing algorithms. So my question is, what is the best path forward? I'll solve a few more of your sets below for more proof, although some sets/goals require more memory than my computer has. For now I wont share the details of the algorithm for obvious reasons. Some other interesting notes: - Goal=150: Set=(1...100), there are 19,378,091 subsets that sum to 150 (94 seconds to compute)
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Incorrect prediction on native model
Similar products
Go-dutchflag – An implementation of the Dutch flag problem in Golang
The AZ Problem
Someone Else's Problem
The farmer, wolf, goat and cabbage problem
Monty Hall Problem
Wolf, Goat and Cabbage Problem
Guiderail – How I (partly) solved my procrastination problem
Are the Riemann Hypothesis and Navier-Stokes the Same Problem?
The problem with the epsilon greedy method
The "What's for dinner" problem solved!