Graph isomorphism problem-advance in complexity research

[marcus]

There seems to have been a major step forward in complexity research. somebody wrote a pleasant understandable piece about it in Quanta magazine.
https://www.quantamagazine.org/20151214-graph-isomorphism-algorithm/

I gave the title an "intermediate" tag because the graph isomorphism problem is simple to state and easy to understand at Undergrad (even high school) level. And the new algorithm that gets a grip on it (without completely solving it) is also easy to describe in elementary terms.

So this makes for a surprisingly easy-to-read enjoyable article, even though the problem is one of the big non-trivial ones in the complexity of algorithms study area.

I didn't see a section of Math forum that is explicitly for graph theory---Topology seemed the closest. Also Topology forum has some threads about combinatorial questions. Nor did i see a section explicitly for complexity research. Like for papers bearing on the "P versus NP-complete" question. Or does this thread belong in the Computation section? If so feel free to move it.

 

[jvicens]

Dear fellow scientist,

Thank you for sharing the article from Quanta magazine about the advancements in complexity research, specifically in the area of graph isomorphism. I agree that this is a major step forward and it is exciting to see progress being made in such a challenging problem.

I appreciate your classification of the article as "intermediate" and I agree that the graph isomorphism problem is simple to state and understand at the undergraduate level. It is encouraging to see that the new algorithm is also easy to describe in elementary terms, making it accessible to a wider audience.

I also noticed the lack of a specific section for graph theory and complexity research in the forum. Perhaps it would be beneficial to create a new section dedicated to these topics, as they are important and relevant in the field of mathematics and computer science.

Thank you again for sharing this article and I look forward to discussing and learning more about the advancements in complexity research with you.