3 ms·
That would be nice, the problem is that nobody has a good way of doing that. Like the analogy I gave elsewhere, it's sort of like a hash function: doable to com
by pontus 6y ago
That would be nice, the problem is that nobody has a good way of doing that. Like the analogy I gave elsewhere, it's sort of like a hash function: doable to compute in one direction but seemingly impossible to invert. If that's the case it's be very difficult to create such a tree to prune because there's no way to categorize the nodes. In other words, the depth of the tree would be 1 and the breadth would be ~10^500.
- knuthsat 6y agoInteresting, the first thing that I assumed was that it's easy to compare one solution to another and get a nice finegrained comparison. For example, a set of solutions with some parameter is always inferior to another set with a better parametrization.