Yenching University.

Door area.

"If any np problem can be converted into a certain np problem through a polynomial time algorithm, then this np problem is called an np complete problem..."

"After all, the np complete problem is the non-deterministic problem of the complexity of polynomials..."

“np=p?”

"The key is this question mark..."

Chen Zhou was buried in front of the desk, frowning and sorting out his own ideas.

On the desk, there were some blank spaces in the draft paper he brought back from Stockholm.

But at this moment, all of them have been filled with mathematical formulas or recorded texts.

"Oh..." Chen Zhou sighed softly, and said, "It's still the same path. Whether it is clear or not, will it change? Or will it not change?"

"If there is no change, can it eventually fall into determinism? Just like those calculation problems such as addition, subtraction, multiplication and division, there are clear formulas, and step by step calculations are deterministic..."

"However, can some problems be calculated step by step?"

Thinking of this, Chen Zhou reached out and took out a brand new A4 draft paper and wrote down two questions.

【Question on finding large prime numbers】

【Problem of large composite decomposition of prime factors】

There is no doubt that these are the two simplest examples.

It is also two problems that cannot be calculated step by step and directly step by step.

There is no formula that can be used to calculate step by step what the next prime number should be.

There is no formula. If you can substitute the combined numbers and directly calculate the decomposition factors of each of them.

With habitually lit these two questions with a pen, Chen Zhou planned to start from the simplest questions to verify his ideas.

"These two are the simplest non-deterministic problems. Although there is no deterministic calculation formula, there is an algorithm that can verify the correctness and error of the results..."

"If you extend the ideas of these two issues..."

"If this algorithm can be calculated in polynomial time, it will become a polynomial non-deterministic problem..."

"If all possible answers to this question can be checked correctly or not through this algorithm in polynomial time, it will become a complete polynomial non-deterministic problem..."

Following this idea, Chen Zhou began to sort it out.

Even at the awards dinner, he grabbed the inspiration like a hysterical attack.

But it is still very difficult to directly solve the complete problem of np, even exceeding his estimate.

This is also the reason why he now starts from the simplest questions to verify his ideas.

There are two benefits to doing this.

First, find the blind spots of your own thinking and solve hidden problems.

Second, the wrong question set can be used to exert its power.

"According to the general solution, the answers to the nondeterministic problem of complete polynomials can be obtained by exhaustive methods. As long as one tests are carried out one by one, the result can be obtained in the end."

"However, the algorithm problem will be highlighted. The complexity of the algorithm is an exponential relationship. The time of this algorithm increases exponentially with the complexity of the problem, and it will soon become uncalculable."

"If you get here, you can push it to the complete problem of np, but..."

While sorting out, Chen Zhou transferred the problem to the complete problem of np.

This is also the path that academics took when this question was first asked.

Because all complete polynomial nondeterminism problems can be converted into a class of logical operation problems called satisfaction problems.

So, if all possible answers to such questions can be calculated in polynomial time, is there a deterministic algorithm for this kind of question that can be directly calculated or the correct answer can be found in polynomial time?

This is the famous conjecture of the complete problem of np.

Now the academic community has proposed two possibilities to solve this conjecture.

One is to find an algorithm that may exist. As long as you find an algorithm for a specific NP complete problem, all such problems can be solved easily.

Because they can be translated into the same problem.

Another possibility is that such an algorithm does not exist.

Then we need to prove from mathematical theory why it does not exist.

No matter which possibility it is, it actually returns to the essence of the np complete problem, that is, the question mark.

However, after returning to the essence of the problem, there is no idea.

Many people are speculating whether new mathematical ideas need to be born to completely solve this problem.

Now Chen Zhou has gradually returned to the essence of the problem and returned to this question mark.

Then, straighten the question mark...

A week passed quickly after Chen Zhou came back from Stockholm.

The fun outside continued for a whole week.

Even a happy day like Christmas and New Year's Day cannot dilute this excitement.

And there is a trend of getting deeper and deeper in this excitement.

After all, Chen Zhou's trip to Stockholm really created too many exciting topics.

As the center of the topic, Chen Zhou stayed in the dormitory very calmly, continuing to study the NP complete problem.

In addition to the two pieces he brought back from the airport, he took photos and posted on Weibo on the two medals he had brought back without hesitation.

I never said a word again, and I didn't even answer one of the phone calls.

The reason why I didn't answer the phone was naturally because my phone was turned off.

This also made Li Zhenbang and others, who were originally planning to hold a celebration banquet for Chen Zhou, had no choice but to give up temporarily and wait until Chen Zhou finished his research.

After all, he dared not disturb Chen Zhou's research. Who knows that the earth-shaking research results are about to be published.

If he interrupted Chen Zhou's thoughts, the crime would be great, and the old leader would have to criticize him for being a bloody spurt.

But what Li Zhenbang didn't expect was that another month had passed.

During this period, Chen Zhou seemed to have disappeared, with no news at all.

If it weren't for the fact that Chen Zhou had been staying in Yan University dormitory, he would have been worried about whether there would be something wrong with Chen Zhou's safety.

"Sorry, the phone number you called has been turned off..."

Listening to the prompt sound from the phone, Li Zhenbang shook his head helplessly.

It was fine in the first half of this month. He was still as busy as before.

But in the next half a month, as the verification of the controllable nuclear fusion plan was implemented one after another, he gradually had time.

However, the problems that followed also arise.

Because the final implementation of the controllable nuclear fusion plan, that is, the final project establishment, Chen Zhou still needs to come forward.

Although they gathered a large group of people to check the plan, some key questions must be answered by Chen Zhou.

Especially in the three or five years that Chen Zhou said, these people didn’t believe it at all.

Simply put, the project establishment of a controllable nuclear fusion project is inseparable from Chen Zhou. Li Zhenbang needs Professor Chen very much at this moment.

Not to mention it, Li Zhenbang called Chen Zhou less than ten times in the first half month, but after half month, he had already made dozens of calls.

Li Zhenbang is really anxious...
Chapter completed!