Questions Tagged [np-complete]

NP-Complete refers to the hardest known problems within the complexity class NP. The "Traveling salesman problem" is one of the most widely known NP-Complete problems.

Question is empty. Ask new Question

Popular Questions