News for hackers. Stuff that matters.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by slashcom on Wednesday January 19, 2011 @07:05PM (#2121881)
Zero other (english) publications by the author in the Cornell archive and only four references within. Not an indicator as to whether the paper is correct (I haven't read it), but that's "smelly".
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by vilda on Wednesday January 19, 2011 @08:18PM (#2122108)
Not really. There are many great researchers publishing in their language only. Especially in countries where research is not heavily funded. For some, 800EUR for a conference is just too much.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by dauphin on Wednesday January 19, 2011 @07:33PM (#2121967)
Yeah, and, seriously, a Russian?! Please...
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by mitko on Wednesday January 19, 2011 @09:47PM (#2122387)
Why not a Russian? For example the Russian Mathematics Olympiad is considered harder than the International Math Olympiad by many of the top contestants.

Edit: why downvoting?

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by spicyj on Wednesday January 19, 2011 @09:50PM (#2122398)
I interpreted dauphin's comment as sarcasm.