Related papers: Finite and infinite basis in P and NP
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and conjunctive…
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that…
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
In this paper we evaluate how constructive heuristics degrade when a problem transits from P to NP-hard. This is done by means of the linear ordering problem. More specifically, for this problem we prove that the objective function can be…
We give a new, direct proof of the tetrachotomy classification for the model-checking problem of positive equality-free logic parameterised by the model. The four complexity classes are Logspace, NP-complete, co-NP-complete and…
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries in a useful…
The vast majority of scientific community believes that P!=NP, with countless supporting arguments. The number of people who believe otherwise probably amounts to as few as those opposing the 2nd Law of Thermodynamics. But isn't nature…
In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…
We study an equation governed by a discontinuous fully nonlinear operator. Such discontinuities are solution-dependent, which introduces a free boundary. Working under natural assumptions, we prove the existence of $L^p$-viscosity and…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…
We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the $k$-List Coloring, List $k$-Coloring, and $k$-Precoloring Extension problems on bipartite graphs with diameter at…
In this paper we study two problems related to the drawing of level graphs, that is, T-LEVEL PLANARITY and CLUSTERED-LEVEL PLANARITY. We show that both problems are NP-complete in the general case and that they become polynomial-time…
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…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
This paper investigates the existence, nonexistence, and qualitative properties of p-harmonic functions in the upper half-space $\mathbb{R}^N_+ \, (N \geq 3)$ satisfying nonlinear boundary conditions for $1<p<N$. Moreover, the symmetry of…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
We show the existence and multiplicity of concentrating solutions to a pure Neumann slightly supercritical problem in a ball. This is the first existence result for this kind of problems in the supercritical regime. Since the solutions must…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…