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.