Ask Question
25 February, 00:42

P versus NP.

Hodge conjecture.

Riemann hypothesis.

Yang-Mills existence and mass gap.

Navier-Stokes existence and smoothness.

Birch and Swinnerton-Dyer conjecture.

+3
Answers (2)
  1. 25 February, 02:06
    0
    umm nice question

    give me a moment to think
  2. 25 February, 03:04
    0
    The problem of P versus NP is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly ... The class of questions for which an answer can be verified in polynomial time is called NP, which stands for "nondeterministic polynomial time". I don't know this answer, more to read about.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “P versus NP. Hodge conjecture. Riemann hypothesis. Yang-Mills existence and mass gap. Navier-Stokes existence and smoothness. Birch and ...” in 📘 Arts if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers