Related papers: Parameterized Resolution with bounded conjunction

We provide a number of simplified and improved separations between pairs of Resolution-with-bounded-conjunction refutation systems, Res(d), as well as their tree-like versions, Res*(d). The contradictions we use are natural combinatorial…

In this paper the interfering resonances parameters determination ambiguity is considered. It is shown that there are two solutions for two fixed width resonances. Analytical relation between different solutions is derived. Numeric…

We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…

We find, motivated by real-world applications, that the well-known request-response specification comes with multiple variations, and that these variations should be distinguished. As the first main contribution, we introduce a…

We consider the problem of reconstructing binary images from their horizontal and vertical projections. We present a condition that the projections must necessarily satisfy when there exist two disjoint reconstructions from those…

For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolution refutations of a propositional statement that the formula has a resolution refutation. We describe three applications. (1) An open question in…

We present a method for reducing the treewidth of a graph while preserving all the minimal $s-t$ separators. This technique turns out to be very useful for establishing the fixed-parameter tractability of constrained separation and…

We consider a second order, two-point, singularly perturbed boundary value problem, of reaction-convection-diffusion type with two small parameters, and we obtain regularity results for its solution. First we establish classical…

Motivated by phase transitions in combinatorial optimization problems, we define two kinds of geometry-preserving reductions between constraint satisfaction problems and other NP-search problems. We give a couple of examples and…

This paper presents an in-depth analysis of a parametrized version of the resolvent composition, an operation that combines a set-valued operator and a linear operator. We provide new properties and examples, and show that resolvent…

The general form of solutions for parameters of interfering Breit-Wigner resonances is found. The number of solutions is determined by the properties of roots of corresponding characteristic equation and does not exceed $2^{N-1}$, where $N$…

A model for reference use in communication is proposed, from a representationist point of view. Both the sender and the receiver of a message handle representations of their common environment, including mental representations of objects.…

We establish the boundedness character of solutions of a system of rational difference equations with a variable coefficient

We perform a fundamental investigation of the complexity of conjunctive query evaluation from the perspective of parameterized complexity. We classify sets of boolean conjunctive queries according to the complexity of this problem. Previous…

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

In this note one shows that the four persistence diagrams and measures defined in [5] are particular cases of the maps and the measures discussed in [2] and [1]

We consider imaging of two partially coherent sources and derive the ultimate quantum limits for estimating the separation, location, relative intensity, and coherence factor. We show that super-resolution in the separation is achievable…

We first highlight the main differences between second order and higher order linear parabolic equations. Then we survey existing results for the latter, in particular by analyzing the behavior of the convolution kernels. We illustrate the…

We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are…

We consider list versions of sparse approximation problems, where unlike the existing results in sparse approximation that consider situations with unique solutions, we are interested in multiple solutions. We introduce these problems and…