Complexity Theory and the Millennium Problem P vs NP

https://is1-ssl.mzstatic.com/image/thumb/Podcasts126/v4/05/46/ae/0546ae66-945a-271a-4d3b-ee46855fa8f1/mza_2373265647691803754.jpg/600x600bb.jpg

MASSA Podcast

MASSA Concordia

34 episodes

2 days ago

The MASSA Podcast shares educational, inspiring and useful content made for Concordia students in the Math and Stats department. Featuring a wide variety of knowledgeable guest speakers such as alumni, teachers and professionals from different industries, the MASSA Podcast will cover subjects from interview skills to career paths to managing stress. You will definitely learn from our guest speakers' advice for success.

Education

RSS

All content for MASSA Podcast is the property of MASSA Concordia and is served directly from their servers with no modification, redirects, or rehosting. The podcast is not affiliated with or endorsed by Podjoint in any way.

Education

https://d3t3ozftmdmh3i.cloudfront.net/production/podcast_uploaded_episode/6795393/6795393-1636782709816-db579bc316d84.jpg

Complexity Theory and the Millennium Problem P vs NP

MASSA Podcast

33 minutes 31 seconds

4 years ago

Complexity Theory and the Millennium Problem P vs NP

Ever wondered what is the best way a mathematician can make a million dollars?

In this episode, we invite Denis Pankratov to the show to talk about his research interests. He is an assistant professor from the Department of Computer Science and Software Engineering of Concordia University. Indulge yourself with professor Pankratov’s clear explanations of complexity theory and algorithm design, as well as his sharp examples on how algorithm design is used. Enlighten yourself with the clear and thought-provoking discussion about the millennium problem, P vs NP, and how solving this impenetrable question can benefit humanity. Prepare to be bedazzled with knowledge!

If you enjoyed this episode, please consider watching Scott Aaronson’s video lectures on YouTube: https://youtu.be/uThFd-H7YCE. Looking for something to read? Perhaps you should consider reading Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Garey and David S. Johnson Gary.