相关论文: The P versus NP Brief

In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…

An attempt of a new kind of complexity anthropology is considered.

Are P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.

In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…

This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).

Starting with a novel definition of divided differences, this essay derives and discusses the basic properties of, and facts about, (univariate) divided differences.

Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text.

We claim to resolve the P=?NP problem via a formal argument for P=NP.

This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend…

This paper has been withdrawn Abstract: This paper has been withdrawn by the author due to the publication.

Motivated by the fact that information is encoded and processed by physical systems, the P versus NP problem is examined in terms of physical processes. In particular, we consider P as a class of deterministic, and NP as nondeterministic,…

Although whether P equals NP is an important, open problem in computer science, and although Jaeger's 2008 paper, "Solving the P/NP Problem Under Intrinsic Uncertainty" (arXiv:0811.0463) presents an attempt at tackling the problem by…

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

The open question, P=NP?, was presented by Cook (1971). In this paper, a proof that P is not equal to NP is presented. In addition, it is shown that P is not equal to the intersection of NP and co-NP. Finally, the exact inclusion…

This text is an introduction to the study of NIP (or dependent) theories. It is meant to serve two purposes. The first is to present various aspects of NIP theories and give the reader the background material needed to understand almost any…

NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…

In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can…

The purpose of this article is to motivate the study of invariant, and especially conformally invariant, differential pairings. Since a general theory is lacking, this work merely presents some interesting examples of these pairings,…

A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…

The routine definitions of both entropy, and differential entropy show inconsistencies that make them not reciprocally coherent. We propose a few possible modifications of these quantities so that 1) they no longer show incongruities, 2)…