Related papers: An NP-hardness Result on the Monoid Frobenius Prob…
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard…
We consider a quasilinear parabolic stochastic partial differential equation driven by a multiplicative noise and study regularity properties of its weak solution satisfying classical a priori estimates. In particular, we determine…
We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.
A DFA $\mathcal{A}$ is composite if there exist DFAs $\mathcal{A}_1,\dots,\mathcal{A}_t$ with $\mathcal{L}(\mathcal{A}) = \bigcap_{i=1}^{t} \mathcal{L}(\mathcal{A}_i)$ such that each $\mathcal{A}_i$ has strictly less states than the minimal…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
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…
Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…
We show that an irreducible ordinary differential equation on the projective line has a Frobenius structure for a power of some prime p if it is rigid in the sense of Katz and satisfies some other reasonable (and necessary) conditions…
We study the computational complexity of the general network satisfaction problem for a finite relation algebra $A$ with a normal representation $B$. If $B$ contains a non-trivial equivalence relation with a finite number of equivalence…
We prove that persuasion is an NP-complete problem.
The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
We study the complexity of problems related to subgame-perfect equilibria (SPEs) in infinite duration non zero-sum multiplayer games played on finite graphs with parity objectives. We present new complexity results that close gaps in the…
In this paper, we investigate a class of nonlinear eigenvalue problems resulting from quantum physics. We first prove that the eigenfunction cannot be a polynomial on any open set, which may be reviewed as a refinement of the classic unique…
We prove the existence of non-trivial solutions to a system of coupled, nonlinear, Schroedinger equations with general nonlinearity.
Assuming that P is not equal to NP, the worst-case run time of any algorithm solving an NP-complete problem must be super-polynomial. But what is the fastest run time we can get? Before one can even hope to approach this question, a more…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We solve some forms of non homogeneous differential equations in one and two dimensions. By expanding the solution into whell-posed closed form-Eisenstein series the solution itself is quite simple and elementary. Also we consider Fourier…
We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time, and known solutions may not remain valid after the change.…