Related papers: Parameterized Resolution with bounded conjunction
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals $D_1$ and $D_2$ are \emph{disjoint} if their intersection is empty (i.e., no interval of $D_1$ intersects any interval of $D_2$). There can be…
We study the separability problem for automatic relations (i.e., relations on finite words definable by synchronous automata) in terms of recognizable relations (i.e., finite unions of products of regular languages). This problem takes as…
This paper describes RESOLVE, a system that uses decision trees to learn how to classify coreferent phrases in the domain of business joint ventures. An experiment is presented in which the performance of RESOLVE is compared to the…
We present a simple geometric framework for the relational join. Using this framework, we design an algorithm that achieves the fractional hypertree-width bound, which generalizes classical and recent worst-case algorithmic results on…
We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible…
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separation number. For this we introduce the parameterized…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
We investigate the size complexity of proofs in $Res(s)$ -- an extension of Resolution working on $s$-DNFs instead of clauses -- for families of contradictions given in the {\em unusual binary} encoding. A motivation of our work is size…
The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…
We characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.
We compare some algebras appeared in the recent attempts to prove resolution of singularities in positive characteristic. We also construct an algebra which encodes the same information and it is equivalent, up to integral closure, to the…
We present here the explicit parametric solutions of second order differential equations invariant under time translation and rescaling and third order differential equations invariant under time translation and the two homogeneity…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
We consider the abstract relational reasoning task, which is commonly used as an intelligence test. Since some patterns have spatial rationales, while others are only semantic, we propose a multi-scale architecture that processes each query…
Two-point super-resolution is an important problem in many signal processing applications. In this paper, we aim to establish a resolution theory for two-point super-resolution from a single snapshot. We consider a complex two-point model…
In this work we consider the primal mixed variational formulation of the Poisson equation with a line source. The analysis and approximation of this problem is non-standard as the line source causes the solutions to be singular. We start by…
This letter announces and summarizes results obtained in arXiv:1111.5051 and considers several natural extensions. The aforementioned paper proposes a procedure to reconstruct coefficients in a second-order, scalar, elliptic equation from…
We develop and analyze a nonlinear reduced basis (RB) method for parametrized elliptic partial differential equations based on a binary-tree partition of the parameter domain into tensor-product structured subdomains. Each subdomain is…