9I制作厂免费

Dear all,

听

This is a reminder that the Mathematics & Statistics Graduate Student Seminar will convene today at 1:00pm in the Main Lounge (Burnside 1025). As usual, there will be pizza.

听

This week, Reginald will discuss the P vs NP problem:

听

One of the most well-known open problems in mathematics today is the P vs NP problem. Here, P and NP refer to classes of computational problems for which, despite the best efforts of many researchers over the past 50 years, we still do not know if P = NP.

听

I will introduce the theory around this problem, defining both P and NP, and go on to present Ladner's theorem, which posits the existence of problems between P and NP-complete, provided P is not equal to NP. While it is still unproven if any "interesting" problems lie in this class, we suspect that important problems such as integer factorization, the discrete log, and the graph isomorphism problems are in this class.

听

See you all there!

听

All graduate students are invited. As with all talks in the graduate student seminar, this talk will be accessible to all graduate students in math and stats. This seminar was made possible by funding from the 9I制作厂免费 Mathematics and Statistics Department and PGSS.

听