This chapter is not finished yet, please click the next page to continue reading the exciting content! "Excuse me, on page 47, the trade-off between the running time of the approximate algorithm and the approximate guarantee, the sum of squares hierarchy can be applied to exponential time

How did the reporter get this proof of an approximation algorithm where n represents the number of vertices r of the graph that can be any positive real number greater than 1 (possibly depending on n)?"

As soon as this question came up, there was a commotion in the auditorium.

The rustling sounds of exchanges intertwined in the extremely spacious auditorium, and many people cast surprised, surprised, confused and even mocking looks at the doctoral student who stood up to ask questions.

Hearing the question, Liu Jiaxin was stunned for a moment at the reporting table. After confirming the question, she explained: "The moderate exponential time approximation algorithm for vertex coverage, uniform sparse cut and related problems is not mine.

Prove the results.”

"If I remember correctly, in the subsequent explanation, Professor Luca Trevisan's report paper at the 2018 International Congress of Mathematicians was quoted."

"You can look at the sixth quote in the line. Professor Trevisan has given a fairly complete explanation."

Hearing that he had raised a question that had already been solved by others, the doctoral student from the University of Edinburgh suddenly turned red, said "thank you" in a mosquito-like voice, and sat back with an embarrassed look on his face.

It's one thing to not be good at studying, but it's also another thing to have the courage to ask questions at the report meeting. Even if you ask the wrong question, it doesn't matter.

But it is obvious that this kind of people have doubts in their minds and will not even read the cited papers, nor will they search in advance to see if there is already a solution to the problem. If they raise it, they will only be laughed at.
Chapter completed!