Related papers: $NP/CLP$ Equivalence: A Phenomenon Hidden Among Sp…
We prove an algorithmic regularity lemma for $L_p$ regular matrices $(1 < p \leq \infty),$ a class of sparse $\{0,1\}$ matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
Necessary and sufficient conditions for the existence of solutions to the asymmetric $L_p$ Minkowski problem in $\mathbb{R}^2$ are established for $0 < p < 1$.
Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in \cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers…
We study integer linear programs (ILP) of the form $\min\{c^\top x\ \vert\ Ax=b,l\le x\le u,x\in\mathbb Z^n\}$ and analyze their parameterized complexity with respect to their distance to the generalized matching problem, following the…
$P \overset{\text{?}}{=} NP$ or $P\ vs\ NP$ is the core problem in computational complexity theory. In this paper, we proposed a definition of linear correlation of derived matrix and system, and discussed the linear correlation of $P$ and…
Changepoint localization is the problem of estimating the index at which a change occurred in the data generating distribution of an ordered list of data, or declaring that no change occurred. We present the broadly applicable MCP…
Sparse coding algorithms are about finding a linear basis in which signals can be represented by a small number of active (non-zero) coefficients. Such coding has many applications in science and engineering and is believed to play an…
A new proof is given for the mathematical equivalence among three $k$-sparse controllability problems of a networked system, which plays key roles in Olshevsky,2014, in the establishment of the NP-hardness of the associated minimal…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP. It is shown that among all NP-systems with model checking problem in NP, the…
Let $\{Z_t, t\geq 0\}$ be a strictly stable process on $\R$ with index $\alpha\in (0,2]$. We prove that for every $p > \alpha$, there exists $\gamma = \gamma (\alpha, p)$ and $\k = \k (\alpha, p)\in (0, +\infty)$ such that…
Many real world practical problems can be formulated as $\ell_{0}$-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative signals to underdetermined linear systems. They have been widely applied in signal…
Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $\max\{c^\top x \colon A x = b,\, x \in \mathbb{Z}^n_{\geq 0}\}$, where all the entries of $A,b,c$ are integer, parameterized by the…
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n, any m x 1 vector b, and any positive real number epsilon…
Correlation Clustering is a fundamental and widely-studied problem in unsupervised learning and data mining. The input is a graph and the goal is to construct a clustering minimizing the number of inter-cluster edges plus the number of…
Optimization problems over permutation matrices appear widely in facility layout, chip design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this problem is NP-hard due to the combinatorial nature of…
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 article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Let $1\leq p < \infty$ and $1\leq r \leq p^\ast$, where $p^\ast$ is the conjugate index of $p$. We prove an omnibus theorem, which provides numerous equivalences for a sequence $(x_n)$ in a Banach space $X$ to be a $(p,r)$-null sequence.…