相关论文: NP - P is not empty

Circuit lower bounds are important since it is believed that a super-polynomial circuit lower bound for a problem in NP implies that P!=NP. Razborov has proved superpolynomial lower bounds for monotone circuits by using method of…

This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…

We show that every set S in [N]^d occupying less than p^t residue classes for some real number t < d and every prime p, must essentially lie in the solution set of a polynomial equation of degree at most (log N)^C, for some constant C…

The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, verification of whether…

Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral representation, and the lengths of such binary forms are used as a…

We may give rise to some questions related to the mathematical structures of $P$-class and $NP$-class. We have seen that one is a proper subclass of the other. Here we disclose more that $P$- class turns out to be the proper distributive…

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

The Modular Isomorphism Problem asks if an isomorphism of group algebras of two finite p-groups G and H over a field of characteristic p, implies an isomorhism of the groups G and H. We survey the history of the problem, explain strategies…

The complexity classification of the Holant problem has remained unresolved for the past fifteen years. Counting complex-weighted Eulerian orientation problems, denoted as #EO, is regarded as one of the most significant challenges to the…

We compare the complexity of the search and decision problems for the complexity class S2P. While Cai (2007) showed that the decision problem is contained in ZPP^NP, we show that the search problem is equivalent to TFNP^NP, the class of…

Let $\bbk$ be an algebraically closed field of prime characteristic $p$. If $p$ does not divide $n$, irreducible modules over $\frak {sl}_n$ for regular and subregular nilpotent representations have already known(see \cite{Jan2} and…

I prove that if markets are weak-form efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be verified in polynomial time can also be…

We introduce the notion of strong $p$-semi-regularity and show that if $p$ is a regular type which is not locally modular then any $p$-semi-regular type is strongly $p$-semi-regular. Moreover, for any such $p$-semi-regular type, "domination…

We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…