Intractable problems lacking polynomial time solutions necessarily negate the practical efficacy of what type of algorithm?
In complexity theory, problems that lack polynomial-time solutions are considered to be intractable for more than the smallest inputs.