Font
Large
Medium
Small
Night
Prev Index    Favorite Next

Chapter 322 Enlightenment of NP-complete problem?

Seeing this, Chen Zhou shook his head with a smile.

He felt that Zhao Qiqi and Zhu Mingli had completely reached the state of letting themselves go.

As for Li Li, he didn't let himself go.

First, he is more restrained in character, and second, he does not have the conditions to let himself go at all!

Since he and Li Jing were together, Li Jing has been in charge of it...

After setting his eyes on the computer web page again, Chen Zhou slid the mouse wheel and suddenly paused.

It was not because of the content in front of him, but because he suddenly remembered that the avatar he saw on Zhu Mingli’s phone just now was so familiar?

"It's Professor Zhang again?"

Chen Zhou couldn't help but feel a little amused. He still remembers the previous incidents on campus.

But unexpectedly, Professor Zhang Zhongyuan likes mixed campus networks so much.

Can you prove that you have always been a young self by getting along with your students?

Not necessarily, right? At least that head doesn't look like it...

"How many such pentagons are there to design a pentagon and use it to cover a plane without leaving any gaps?"

This is a problem of "plane dense paving" and a problem that has always plagued the mathematics community.

There are many applications of the dense laying theory, such as how to maximize the use of space and save costs when stacking objects.

In crystallography, how to optimize crystal structure also belongs to the application category of dense laying theory.

However, because each inner angle of a regular pentagon is 108 degrees, rather than a factor of 360 degrees, it is impossible to closely pave the plane, and the deformed pentagon can only challenge this problem.

One of the 11 major events in the mathematics world is that mathematicians finally found the 15th pentagon.

This is also one of the two things Chen Zhou is interested in.

Chen Zhou looked at the 15 pentagonal patterns on the webpage with interest.

The pentagonal problem is a geometric field that most scientists are interested in, because it is the only shape that has not yet been fully understood.

This 15th pentagon is also the first pentagon newly discovered in 30 years to meet the conditions.

Chen Zhou thought for a moment, then slid his mouse and looked at the next event of interest.

Now he is just interested and does not intend to buy the field of geometry immediately.

As for Chen Zhou, another thing that is interested in is the progress of the graph isomorphism problem.

This has always been a special issue in complexity theory.

Simply put, it is a question of whether a regular pentagon or a pentagonal star is isomorphic, that is, a one-to-one correspondence between points.

In the description of this matter, it is about the paper submitted by Professor Babai of the University of Chicago at the 2014 seminar.

His results aim to show that solving this problem requires only a quasi-polynomial time slightly longer than the polynomial time.

His achievements are also recognized by most mathematicians, who believe that this will be a huge progress in this field.

It will also give inspiration to the "p/np problem" worth millions of dollars.

That's right, it's the "p/np problem" that is one of the seven millennial problems.

Like the famous "Hilbert 23 Questions" proposed by Hilbert at the International Conference of Mathematicians in 1900.

These are seven world-class mathematical puzzles published by the Clay Institute of Mathematics on May 24, Millennium.

The prize for each puzzle is one million dollars!

The seven major millennial problems are np complete problems (p/np problems), Hodge's conjecture, Poincaré's conjecture, Riemann's conjecture, Young-Milles' gauge field existence and mass interval assumption (gauge field theory), and ns equation solutions

existentiality and smoothness and the BSD conjecture (Berch and Swinetton-Dell conjecture).

So far, only the Poincaré conjecture has been solved by Russian mathematician Perelman.

"Is there any inspiration for the complete problem of np?"

In comparison, among these 11 major events, this one is what interests Chen Zhou the most.

After all, it is a study that has a relationship with the millennium problem.

Although for many people, the last of the 11 major events, that is, Chen Zhou's incident, is even more eye-catching.

Regarding the complete problem of np, let’s give a simple example.

One night, you went to a banquet. Because the banquet was too grand, you felt uneasy, and at this time you would wonder if there were people you knew in the entire banquet hall.

Just then, the host of the banquet suggested to you that you must know the lady who was eating ice cream near the dessert plate.

It takes almost no time to scan there and find that the host of the banquet is correct.

However, without such hints, you have to look around the banquet hall and look at everyone one by one to see if there are people you know.

This is actually like a thing. If one person tells you, 12717421 can be written as the product of two smaller numbers.

You will definitely hesitate and guess if what he said is right.

But, if he tells you that 12717421 can be broken down into 3607 times 3803, then you will get the answer soon and verify that it is right.

This is a simple example of the total problem of np.

As for the conjecture of np complete problem, it refers to that since all complete polynomial nondeterminism problems can be converted into a class of logical operation problems called satisfaction problems.

All possible answers to such questions can be calculated in polynomial time. Is there a deterministic algorithm for this kind of question that can directly calculate or find the correct answer in polynomial time?

It sounds simple, but to verify it, it is completely different.

The np complete problem is also one of the most prominent problems in logic and computer science.

Even though computer science is developing rapidly now, the answer to this question is still unsolvable.

Shaking his head gently, Chen Zhou threw out the messy thoughts in his mind. Whether it could really give rise to the complete problem of NP, he must read Professor Babai's paper.

It just so happened that he also started learning computer science knowledge today.

When Chen Zhou returned the computer to Li Li, he found that Zhu Mingli had not come back yet, so he couldn't help but feel a little amused. What could this be a secret that he would rather run away than keep it secret?

"Brother Chen, can you ask you a question?" Li Li took the computer and stammered.

Chen Zhou glanced at Li Li, then patted his shoulder, and said with a smile: "You guy just say anything? Why are you hesitating?"

Zhao Qiqi also came up and said, "That's right, Brother Chen is not an outsider, why? Two people, are you still unfamiliar?"

Li Li smiled shyly: "No, no..."

Chen Zhou looked at Li Li and wanted to say something, but in the end he didn't say it, just asked: "What's the problem?"

Li Li took out his notebook, turned to the content he wrote today, and pointed to the formula above: "It's about the distribution deconstruction method. I have studied this part for a long time, but I still can't understand it."
Chapter completed!
Prev Index    Favorite Next