Related papers: Generalized Satisfiability Problems via Operator A…
In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of…
The complexity of the promise constraint satisfaction problem $\operatorname{PCSP}(\mathbf{A},\mathbf{B})$ is largely unknown, even for symmetric $\mathbf{A}$ and $\mathbf{B}$, except for the case when $\mathbf{A}$ and $\mathbf{B}$ are…
We extend Fourier analysis to curved spaces by defining a Generalized Fourier Transform (GFT) on any Riemannian manifold $\Sigma$ via spectral decomposition. Under minimal requirements that the transform is an isometric isomorphism and has…
Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…
In a pre-selected Hilbert space of quantum states the unitarity of the evolution is usually guaranteed via a pre-selection of the generator (i.e., of the Hamiltonian operator) in self-adjoint form. In fact, the simultaneous use of both of…
When numerical solution of elliptic and parabolic partial differential equations is required to be highly accurate in space, the discrete problem usually takes the form of large-scale and sparse linear systems. In this work, as an…
We give relatively simple sufficient conditions on a Fourier multiplier, so that it maps functions with the H$\ddot{o}$lder property with respect to a part of the variables to functions with the H$o$lder property with respect to all…
Foundational optimization embeddings have recently emerged as powerful pre-trained representations for mixed-integer programming (MIP) problems. These embeddings were shown to enable cross-domain transfer and reduce reliance on…
In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of quantifier-free…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
A bilevel program is an optimization problem whose constraints involve another optimization problem. This paper studies bilevel polynomial programs (BPPs), i.e., all the functions are polynomials. We reformulate BPPs equivalently as…
In this paper we obtain a description of the Hermitian operators acting on the Hilbert space $\C^n$, description which gives a complete solution to the over parameterization problem. More precisely we provide an explicit parameterization of…
We prove an integral representation result for variational functionals in the space $BV^{\mathcal{B}}$ of functions with bounded $\mathcal{B}$-variation where $\mathcal{B}$ denotes a $k$-th order, $\mathbb{C}$-elliptic, linear homogeneous…
We present a general framework for good CNF-representations of boolean constraints, to be used for translating decision problems into SAT problems (i.e., deciding satisfiability for conjunctive normal forms). We apply it to the…
The main result of this paper is a far reaching generalization of the completeness result given by V.~Katsnelson in a recent paper [35]. Instead of just using a collection of dilated Gaussians it is shown that the key steps of an earlier…
We show that the uniform Constraint Satisfaction Problem (CSP) parameterized by the size of the solution is in W[1] (the problem is W[1]-hard and it is easy to place it in W[3]). Given a single "free" element of the domain, denoted by $0$,…