andBerg and Ulfberg and Amano and Maruoka .. have used ... to prove exponential lower bound ...
This is the way science works: A great result from one author(s), because non-trivial lower bounds are really hard to prove, and another one generalizes the result. And as with Poincaré, the result ##P \neq NP## is simply a corollary.We [Blum] show that these approximators can be used to prove the same lower bound for ...
fresh_42 said:If it is true, then it will be a sensation and I wonder, why the usual pop-science shout-boxes haven't reacted yet.
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.
gravenewworld said:What can the experts decipher on this:
https://arxiv.org/pdf/1708.03486.pdf
Is this going to win a million dollars?
EDIT: The punchline is P =/= NP
The proof is wrong. I shall elaborate precisely what the mistake is. For doing this, I need some time. I shall put the explanation on my homepage
The P v NP problem is a major unsolved question in computer science and mathematics. It asks whether every problem that can be quickly verified by a computer can also be solved by a computer in a reasonable amount of time.
The P v NP problem has significant implications for various fields, including cryptography, optimization, and artificial intelligence. A solution to this problem could vastly improve our ability to solve complex problems efficiently, leading to advancements in many industries.
As of now, there is no known solution for the P v NP problem. It is considered one of the most challenging open problems in computer science, and many experts believe that it may be impossible to solve.
Several approaches have been proposed for solving the P v NP problem, including the use of quantum computers, the development of new algorithms, and the study of complexity classes. However, none of these proposed solutions have been proven to definitively resolve the problem.
The P v NP problem may seem like a purely theoretical problem, but its solution could have a significant impact on everyday life. For example, it could lead to more efficient transportation and logistics systems, better medical diagnoses, and improved cybersecurity measures.