On the principal impossibility to prove P=NP
نویسنده
چکیده
The material of the article is devoted to the most complicated and interesting problem — a problem of P = NP?. This research was presented to mathematical community in Hyderabad during International Congress of Mathematicians [1]. But there it was published in a very brief form, so this article is an attempt to give those, who are interested in the problem, my reasoning on the theme. It is not a proof in full, because it is very difficult to prove something, which is not provable, but it seems that these reasoning will help us to understand the problem of the combinatorial explosion more deeply and to realize in full all the problems to which we are going because of the combinatorial explosion. Maybe we will realize that the combinatorial explosion is somehow a law, such a law, which influences the World, as Newton law of gravitation influences the fall of each thing.
منابع مشابه
About the impossibility to prove P=NP or P!=NP and the pseudo-randomness in NP
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P NP question and the “Deterministic” versus “Non Deterministic” nature of a problem, and more specifically at the temporal nature of the complexity within theNP class of problems. Let us remind that the NP class is called ...
متن کاملComputing Cliques is Intractable
(i) a theorem that is closely related to Erdös and Rado’s sunflower lemma, and claims a stronger statement in most cases, (ii) a new approach to prove the exponential monotone circuit complexity of the clique problem, (iii) NC 6= NP through the impossibility of a Boolean circuit with poly-log depth to compute cliques, based on the conctruction of (ii), and (iv) P 6= NP through the exponential c...
متن کاملA Well-Characterized Approximation Problem
We consider the following NP optimization problem: Given a set of polynomials Pi(x), i = 1 : : : s of degree at most 2 over GF [p] in n variables, nd a root common to as many as possible of the polynomials Pi(x). We prove that in the case when the polynomials do not contain any squares as monomials, it is always possible to approximate this problem within a factor of p 2 p 1 in polynomial time ...
متن کاملOn convergence of sample and population Hilbertian functional principal components
In this article we consider the sequences of sample and population covariance operators for a sequence of arrays of Hilbertian random elements. Then under the assumptions that sequences of the covariance operators norm are uniformly bounded and the sequences of the principal component scores are uniformly sumable, we prove that the convergence of the sequences of covariance operators would impl...
متن کاملThinking Algorithmically About Impossibility∗
Complexity lower bounds like P 6= NP assert impossibility results for all possible programs of some restricted form. As there are presently enormous gaps in our lower bound knowledge, a central question on the minds of today’s complexity theorists is how will we find better ways to reason about all efficient programs? I argue that some progress can be made by (very deliberately) thinking algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1211.3492 شماره
صفحات -
تاریخ انتشار 2012