An Interest In:
Web News this Week
- April 24, 2024
- April 23, 2024
- April 22, 2024
- April 21, 2024
- April 20, 2024
- April 19, 2024
- April 18, 2024
Some of Our Sources
- Mashable
- TutsPlus - Code
- Creative Curio
- Web Designer Depot
- Noupe
- Reencoded
- Android Dissected
- Android Headlines
- Daily Now
- The Verge
Help Webnuz
Referal links:
August 31, 2017 08:00 pm
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/YQ48YCjqJ48/mathematician-who-claimed-p-is-not-equal-to-np-says-his-proof-is-wrong
Mathematician Who Claimed 'P Is Not Equal To NP' Says His Proof Is Wrong
Earlier this month, Norbert Blum, a German mathematician, had published a research paper in which he implied that P is not equal to NP. The abstract of the post read: Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev's function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP. Since the publication of that paper, several mathematicians have raised concerns with Blum's methodology, with some saying that there are flaws in it. Blum has now updated the research paper to add: The proof is wrong. I shall elaborate precisely what the mistake is. For doing this, I need some time.Read more of this story at Slashdot.
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/YQ48YCjqJ48/mathematician-who-claimed-p-is-not-equal-to-np-says-his-proof-is-wrong
Share this article:
Tweet
View Full Article
Slashdot
Slashdot was originally created in September of 1997 by Rob "CmdrTaco" Malda. Today it is owned by Geeknet, Inc..More About this Source Visit Slashdot