since algorithm ''x'' allows us solve problem ''c'' notion hard problems depends type reduction used complexity classes larger p polynomial time reductions commonly used particular set problems hard np set np hard problems problem ''x'' ''c'' hard ''c'' ''x'' said ''complete'' ''c'' means ''x'' hardest problem ''c'' since many problems could equally hard one might say ''x'' one
Formal science Computer science Theory of computation Computational complexity theory