3 ms·
> I think brute force on an NP problem is factorial(n) No, NP ⊆ EXPTIME, which means that exponential time should be enough.
by petters 4y ago
> I think brute force on an NP problem is factorial(n)
No, NP ⊆ EXPTIME, which means that exponential time should be enough.