P and NP problems

A problem is called p, if it can be solved by an algorithm that runs polynomial times (that is, a polynomial function whose running time is at most the input quantity). If the proposed solution can be tested by running polynomial time, the problem is called NP. Does p equal NP?

2

Riemann hypothesis

The real part of every nontrivial zero of Riemannian zeta function is

three

Poincaré conjecture

Any simply connected three-dimensional closed popular homeomorphism in a three-dimensional sphere.

four

hodge conjecture

Any Hodge class of nonsingular complex projective algebraic family is a rational linear combination of some algebraic closed chain classes.

five

Birch and Swinerton-Dale conjecture

For each elliptic curve based on rational number field, the order that its L function becomes zero at 1 is equal to the rank of Abel group of the favorable point on the curve.

six

Naville-Stokes equation

Under suitable conditions, the existence of smooth solutions of three-dimensional Navier-Stokes equation is proved or denied.

seven

Young-Mills theory

The existence and mass gap of quantum Yang-Mills field are proved.