The greatest unsolved problem in computer science...
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Related videos
Gil's Arena ERUPTS Over The Greatest Coach In NBA History
The Arena
213.4k views
Computer Science Degree Unemployment Soars -- Learn to Starve
Eli the Computer Guy
23.0k views
Israel Cruise Ship Protested in Greece -- Greek Government Supports Starvation of Palestinians
Eli the Computer Guy
11.4k views
We Solved the Protein Folding Problem… Now What?
StarTalk
374.4k views
High Unemployment for Computer Science Graduates - Learn to Coal
Eli the Computer Guy
32.0k views
Tackling the Biggest Unsolved Problems in Math with 3Blue1Brown
StarTalk
1.7m views
The END of the Collagen Debate - What the Newest Protein Science Finally Shows
Thomas DeLauer
313.3k views
Inside the All-In Summit: Behind the Scenes of the World's Greatest Conference 🚀
All-In Podcast
86.1k views
Computer Science Students - Listen Up...
Tech With Tim
114.8k views
The Greatest SCANDAL In Modern Presidential History
Ben Shapiro
417.9k views
Top Comments (10)
Fireship posting a non-AI video is a recession indicator
Bro got baited into doing this video because he thought is was related to npm
I have a proof for P vs NP, unfortunately it’s written in polynomial time but takes exponential time to read
Wake up at 3 am and remembering the monster is waiting under the bed: To P or Not to P.
N = 1 . Solved
This is what i think about if i can't sleep at night
To P or not to P, that is the question
3:22 The travelling salesman problem as you described it, looking for the shortest route, is NP-Hard, not NP-Complete, it cannot be verified except by checking every other possible path, which would take the same amount of time as calculating it from scratch. To make it NP-Complete you'd need to modify it to say 'find a route shorter than x metres that visits all cities', that way you could verify it trivially.
Is the old Fireship back before GTAVI?
1:04 in his famous "let him cook video"
Unlock the Data Inside
Turn Videos into Knowledge
- Get FREE 10/day: transcripts, summaries, chats
- Chat with videos, export text & PDF
- $1 free API credit for RAG, chatbots & research
Free forever plan • All features unlocked
Top Comments (10)
Fireship posting a non-AI video is a recession indicator
Bro got baited into doing this video because he thought is was related to npm
I have a proof for P vs NP, unfortunately it’s written in polynomial time but takes exponential time to read
Wake up at 3 am and remembering the monster is waiting under the bed: To P or Not to P.
N = 1 . Solved
This is what i think about if i can't sleep at night
To P or not to P, that is the question
3:22 The travelling salesman problem as you described it, looking for the shortest route, is NP-Hard, not NP-Complete, it cannot be verified except by checking every other possible path, which would take the same amount of time as calculating it from scratch. To make it NP-Complete you'd need to modify it to say 'find a route shorter than x metres that visits all cities', that way you could verify it trivially.
Is the old Fireship back before GTAVI?
1:04 in his famous "let him cook video"