For many mathematical problems we can check if given solution is valid efficiently. However, for some of those problems we do not know an efficient algorithm to decide whether such a solution exists. Here lies the P versus NP question, which asks if all those problems admit efficient algorithms or if some problems are intrinsically harder than others. Considering some classical problems with real-life applications, we discussed the P versus NP question, its theoretical and practical implications, and the various approaches to solve problems for which we do not know efficient algorithms.
The full program of this year’s Trips to the Mathematical Universe lecture cycle is available here.
You are kindly invited!