For Riemann I can recommend this: https://m.youtube.com/watch?v=zlm1aajH6gY
P=NP asks whether any problem for which a solution can be verified in polynomial time, that solution can also be computed in polynomial time. The current consensus is “probably not” but it hasn’t been proven either way.
The others I don’t know enough about.
Latest Answers