Related papers: Many bounded versions of undecidable problems are …
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
Hybrid inverse problems are mathematical descriptions of coupled-physics (also called multi-waves) imaging modalities that aim to combine high resolution with high contrast. The solution of a high-resolution inverse problem, a first step…
We show that the conditional independence (CI) implication problem with bounded cardinalities, which asks whether a given CI implication holds for all discrete random variables with given cardinalities, is co-NEXPTIME-hard. The problem…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…
We consider simply connected bodies or regions of finite extent in space or space-time and write conservation laws associated with the equations in Parts I-IV. We review earlier work where, for elliptic equations,the boundary value problem…
This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact…
We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms…
In the pinwheel problem, one is given an $m$-tuple of positive integers $(a_1, \ldots, a_m)$ and asked whether the integers can be partitioned into $m$ color classes $C_1,\ldots,C_m$ such that every interval of length $a_i$ has non-empty…
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…
Multimarginal Optimal Transport (MOT) is the problem of linear programming over joint probability distributions with fixed marginals. A key issue in many applications is the complexity of solving MOT: the linear program has exponential size…
We prove the existence and uniqueness of weak solution of a Neumann boundary problem for an elliptic partial differential equation (PDE for short) with a singular divergence term which can only be understood in a weak sense. A probabilistic…
We study relationship among versions of the Knapsack Problem where variables take values in Z and the number of them is fixed. In particular, we construct a finitely presented group where the problem of solvability of exponential equations…
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
By topological arguments, we prove new results on the existence, non-existence, localization and multiplicity of nontrivial solutions of a class of perturbed nonlinear integral equations. These type of integral equations arise, for example,…
In computational models of particle packings with periodic boundary conditions, it is assumed that the packing is attached to exact copies of itself in all possible directions. The periodicity of the boundary then requires that all of the…
We establish the existence of weak solutions of a nonlinear radiation-type boundary value problem for elliptic equation on divergence form with discontinuous leading coefficient. Quantitative estimates play a crucial role on the real…
We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as…
In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…