Is this problem NP-Complete?

Assuming P≠NP (yet), answer wether these problems are proven to be NP-COMPLETE or not.
Quiz by
JabariJoker
Rate:
Last updated: December 6, 2024
You have not attempted this quiz yet.
First submittedDecember 6, 2024
Times taken6
Average score81.8%
Report this quizReport
4:00
The quiz is paused. You have remaining.
Scoring
You scored / = %
This beats or equals % of test takers also scored 100%
The average score is
Your high score is
Your fastest time is
Keep scrolling down for answers and more stats ...
1. Towers of Hanoi
This problem is proven to be solved in expnonential time
Yes
No
2. Knapsack Problem
Yes
No
3. Boolean Satisfiability Problem (SAT)
Yes
No
4. Clique Problem
Yes
No
5. Halting Problem
Yes
No
6. Hamiltonian cycle problem
Yes
No
7. 2-SAT (Boolean Satisfiability Problem ×2)
Yes
No
8. Minimum Spanning Tree
Yes
No
9. Vertex Cover Problem
Yes
No
10. Solving Rubik’s Cube
Yes
No
11. Traveling Salesman Problem (TSP)
No
Yes
Save Your Stats
Your Next Quiz
Name all 50 states in the USA. Easy, right?
20 random countries have been removed from the map of the world! Can you identify them in 3 minutes?
Drag the flag onto the correct state. Careful, though! One wrong move and the game ends.
Drag the flag onto the correct country. Careful, though! One wrong move and the game ends.
Comments
No comments yet