NP complete

A problem is NP-complete if it is in the class NP and it is as hard as the hardest problems in NP. 1

They provide a way to show that certain problems are intrinsically difficult to solve. There is no known polynomial time algorithm for solving NP-complete problems.

  1. https://www.autoblocks.ai/glossary/np-completeness ↩