5 ms·

A 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 n

A 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.

anyfoo 5y ago
That much was clear, and I believe also implied in my answers?
- freemint 5y ago
  If what I said was your mental state then you are not wrong.