From failed candidate to chief scientist

Chapter 155 P=NP
Why did Lin Mo suddenly start studying algorithms?
This starts with system tasks.

With the breakthrough in NS equation research and the publication of papers, Lin Mo's Challenge Task 1 has also been systematically confirmed, and the completed tasks have improved.

"Ding, Challenge Task 1 (1/7): The host completed the proof of the existence and smoothness of the Navier-Stokoe equation, and published a paper to gain recognition. Task reward: 10000 points in mathematics."

While the task was completed, a new message popped up.

"Ding, challenge task 1 (2/7): P/NP problem, please complete the research on the problem of two complexity classes P and NP are identical (P=NP?), and publish a paper or report to prove that the results have been achieved Approved. Task reward: 20000 points in mathematics."

really……

Lin Mo shook his head. Just as he had guessed, this system, Challenge 1, really allowed him to complete the Seven Millennium Problems.

When he received the NS equation task before, Lin Mo had guessed that this challenge task 1 was probably about other Millennium problems. Therefore, at that time, he specially found information and analyzed every problem of other Millennium problems. Understood.

So when he saw the new challenge task, the P/NP problem, relevant information quickly emerged in Lin Mo's mind.

What is the P/NP problem?

For computers that process data at high speeds, the efficiency of processing a specific data cannot measure the quality of a program. Instead, it should be seen whether the running time of the program remains the same when the size of the data increases to hundreds of times, or whether the running time increases accordingly. Hundreds of times slower, or tens of thousands of times slower.

Under the same computing resources, people naturally hope that as the complexity of the problem increases, the time used increases within an acceptable range, and the shorter the calculation time, the better.

What meets this requirement is called polynomial-level complexity.

On the contrary, as the responsibility increases, the calculation time increases geometrically, which is called non-polynomial level complexity.

Therefore, people think of a question, that is, can algorithms with polynomial level complexity be found for all problems?
So if a problem can be solved by an algorithm that can be solved in polynomial time, we call it a P problem.

An NP problem refers to a problem that can verify a solution in polynomial time, or a problem that can guess a solution in polynomial time.

All P-type problems are NP problems.In other words, if you can solve a problem polynomially, you must be able to verify the solution of a problem polynomially.

So are NP problems all P problems?
The P=NP problem is to verify or overturn this conclusion.

If it can be proven that P=NP, it means that all NP problems can find algorithms to solve them in polynomial time. This will bring huge changes to computer algorithms and have epoch-making significance.

This problem is the pinnacle of computational mathematics and has attracted countless people's attention and research, but it has always been difficult to solve.It is an ultimate problem that has not been solved even after spending a lot of time and energy. The only thing that can be compared with it is the grand unity in physics.

Continuous research has led many scientists to believe that P=NP is not true, that is to say, there is at least one NP problem that cannot have an algorithm with polynomial complexity.

Many people have conducted research in this direction and want to prove that P≠NP, but after so many years, there is still no progress.

It cannot be proven, and even if you want to falsify it, you cannot do it.

This problem is really difficult to solve.

Lin Mo looked at the mission description and shook his head.And the reward for this mission is, oh, [-] points?
The completed NS equation only has [-] points, but this P/NP problem actually has [-] points?

Does the system think that the P/NP problem is twice as difficult as the NS equation?Or is this a chain of tasks, where each time a link is completed, the task reward is doubled?
Lin Mo shook his head. He couldn't get the answer for the time being. Maybe he would not know what was going on until he completed the research on the P=NP problem and started a new challenge task.

And this is why Lin Mo suddenly approached Jiang Fanjun and wanted to carry out algorithm research.

At the same time as challenge mission 1, challenge mission 2 is also completed.

"Ding, the host has completed the research on the Bockner-Ries multiplier problem, and the task reward is: The Heart of Mathematics."

"Heart of mathematics: You have an extraordinary talent in mathematics. You learn, research, teach, think, create, etc. in mathematics, and all actions related to mathematics will double the effect."

"The current Mathematical Heart effect is unlocked by 3%."

Lin Mo was stunned for a moment, then remembered that the Bockner-Reese multiplier problem was left to Marina to complete. During this period, he provided some ideas and did not really participate much, but the system still counted him as completing the research.

This made Lin Mo's eyes dazzle. If this was possible, could he just find more people to help with the research? When he encountered difficulties in research, he used his keen talents to provide inspiration and solve thinking problems, so that he could be more capable. Complete challenge mission 2 faster and more efficiently, and unlock the mathematical heart as soon as possible?

The more Lin Mo thought about it, the more he felt that this matter was feasible. He wished to act immediately and let Tian Fangyi and Zhang Qihua recruit people. A large number of people were recruited. Our mathematics research center will expand!

Of course, what Lin Mo gained was not only the reward for completing the challenge mission, but also various improvements due to the completion of NS equation research.

Because of the progress of Lin Mo's research, the value of each subject has increased a lot, and basically every subject has received varying degrees of increase in subject value.

Lin Mo's panel at this time:
数学（大师级）——基础数学大师级级（6000/100000）、应用数学精通级（500/10000）计算数学精通级（1500/10000）、运筹学与控制论精通级（50/10000）、概率论与数理统计精通级（2000/10000）

Lin Mo took a look and found that basic mathematics increased the most, by 5000 points, followed by probability theory and mathematical statistics, which increased by 2000 points, computational mathematics by 1500 points, applied mathematics by 500 points, and operations research and control theory. Then it only increased by 50 points.

It was a pleasant surprise.

Previously, the system said that the subject value could only be increased by completing research. Lin Mo didn't know what to do yet. His subject value had not changed for a long time, and now it finally increased.

Although it is still far from the upper limit value behind it, this also gave Lin Mo hope, the hope that his basic mathematics will reach the top of the hall.

However, as the rewards were distributed, a wave of dizziness followed, and Lin Mo felt his eyes go dark.

However, after experiencing the impact of the previous information torrent of 10000 points of subject value at one time, Lin Mo was not overwhelmed by the increase in subject value of several thousand points.

But the huge amount of information still made Lin Mo's brain feel as if it was hit by a high-speed train, and his head was buzzing.

Then there is no more then.

Lin Mo could only hold on for a few seconds before, without any surprise, he fainted again.

(End of this chapter)