Related papers: An NP-hardness Result on the Monoid Frobenius Prob…
In this paper, we consider the existence and non-existence of non-trivial solution to a Brezis-Nirenberg type problem with singular weights. First, we obtain a compact imbedding theorem which is an extension of the classical…
We consider possibly degenerate and singular elliptic equations in a possibly anisotropic medium. We obtain monotonicity results for the energy density, rigidity results for the solutions and classification results for the…
The paper studies the large-time behavior of solutions to the Robin problem for PDEs with critical nonlinearities. For the considered problems, nonexistence results are obtained, which complements the interesting recent results by Ikeda et…
In this paper, we study the solvability problem for one kind of fully coupled forward-backward stochastic difference equations (FBS{\Delta}Es). With the help of the necessary and sufficient condition for the solvability of the linear…
In this paper, we have considered second order non-homogeneous linear differential equations having entire coefficients. We have established conditions ensuring non-existence of finite order solution of such type of differential equations.
We show that the problem of checking if a given nondeterministic parity automaton simulates another given nondeterministic parity automaton is NP-hard. We then adapt the techniques used for this result to show that the problem of checking…
In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
We claim to resolve the P=?NP problem via a formal argument for P=NP.
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…
In this paper, we are concerned with the following type of elliptic problems: $$ (-\Delta)^{\alpha} u+a(x) u=\frac{|u|^{2^*_{s}-2}u}{|x|^s}+k(x)|u|^{q-2}u, u\,\in\,H^\alpha({\mathbb R}^N), $$ where $2<q< 2^*$, $0<\alpha<1$, $0<s<2\alpha$,…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the…
We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is the standard representation of a PA-provable formula. We show…
One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…
Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…
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. But there it…