#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

NP-Hard problems are problems that are...

Answer

intractable