3 ms·
Correct me if I'm wrong: So n is actually the size of the hash. That's indeed exponential if you try to brute force it, but a non-deterministic automaton would
by anyfoo 5y ago
Correct me if I'm wrong: So n is actually the size of the hash. That's indeed exponential if you try to brute force it, but a non-deterministic automaton would still give the answer immediately.
- freemint 5y agoA non-deterministic automata can you give an answer after n steps which is polynomial. NP is the class of problems that can be solved in polynomial time by a non-deterministic automaton.