3 ms·
There's a big difference between having a verifiable theory for something which is computationally hard, and having no theory at all!
by tome 18y ago
There's a big difference between having a verifiable theory for something which is computationally hard, and having no theory at all!
- cool-RR 18y agoI'm sorry, I didn't understand what you are saying. Are you saying that the problem I gave was computationally hard? I only want the algorithm, regardless of how computationally hard it is.