3 ms·

What about them?

• amichail 17y ago
  At least two of the people acknowledged are world famous algorithms researchers. But it's not clear how much of the paper they looked at and whether they think it's correct.
  • _delirium 17y ago
    Yeah, I'd be curious what the opinions of other researchers in this area are. There have been a number of debunked polynomial time algorithms for GI, so it's one of those things people are always skeptical of; but that of course doesn't mean this one is wrong too. The author of the paper recently posted a blog comment in which he says he submitted to a few journals, and complains that "referees did not find any fatal error in my proof, but all the journals rejected this paper": http://rjlipton.wordpress.com/2009/05/04/an-approach-to-graph-isomorphism/#comment-3156 http://rjlipton.wordpress.com/2009/05/04/an-approach-to-grap... I'd take that as evidence that the referees at least didn't think it was a successful proof. The comment is attached to an old blog post about the problem from a well-known theoretical computer scientist (R.J. Lipton), but since it was posted about a year after the initial post, it hasn't gotten any replies.