[Verse 1]
In the realm where problems dance and hide
Some can solve in polynomial time
But others lurk in shadows deep
Where exponential nightmares creep
When P meets NP, the question burns
Will efficient algorithms return?
[Chorus]
NP-complete, the hardest breed
Every NP problem can reduce indeed
Polynomial transformations flow
To these titans we all know
NP-hard but still inside
The nondeterministic divide
[Verse 2]
Cook and Levin proved the cornerstone
SAT stands on its Boolean throne
Satisfiability leads the way
Every variable true or false must say
Three literals dance in each constraint
Making 3-SAT the perfect saint
[Chorus]
NP-complete, the hardest breed
Every NP problem can reduce indeed
Polynomial transformations flow
To these titans we all know
NP-hard but still inside
The nondeterministic divide
[Bridge]
Vertex cover hides the minimum set
Clique seeks friends that always connect
Hamilton wanders every node once
Subset sum counts numerical hunts
Traveling salesman tours the map
Decision version springs the trap
[Verse 3]
To prove a problem joins this elite club
Show it lives in NP first, no flub
Then reduce from something known complete
Watch polynomial time compete
Karp's twenty-one problems paved the street
Now thousands share this bitter sweet
[Chorus]
NP-complete, the hardest breed
Every NP problem can reduce indeed
Polynomial transformations flow
To these titans we all know
NP-hard but still inside
The nondeterministic divide
[Outro]
If one falls to polynomial grace
Then P equals NP takes its place
But until that golden day arrives
Completeness theory still survives