Related papers: Generalized Satisfiability Problems via Operator A…
Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…
The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting…
We obtain a general concept of triplet of Hilbert spaces with closed (unbounded) embeddings instead of continuous (bounded) ones. The construction starts with a positive selfadjoint operator $H$, that is called the Hamiltonian of the…
This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…
The article considers one of the possible generalizations of constraint satisfaction problems where relations are replaced by multivalued membership functions. In this case operations of disjunction and conjunction are replaced by maximum…
We present novel algorithms for design and design space exploration. The designs discovered by these algorithms are compositions of function types specified in component libraries. Our algorithms reduce the design problem to quantified…
We introduce here new generalized principal eigenvalues for linear parabolic operators with heterogeneous coefficients in space and time. We consider a bounded spatial domain and an unbounded time interval $I$ : $I=\mathbb{R},\…
We study a class of hyperbolic Cauchy problems, associated with linear operators and systems with polynomially bounded coefficients, variable multiplicities and involutive characteristics, globally defined on R^n. We prove well-posedness in…
We consider the covariant quantization of generalized abelian gauge theories on a closed and compact n-dimensional manifold whose space of gauge invariant fields is the abelian group of Cheeger-Simons differential characters. The space of…
We construct fractional Sobolev spaces on arbitrary time scales, both in one dimension and on product time scales. In 1D, we define $W^{\alpha(\cdot),p}_{\mathrm{rd}}(\mathcal I)$ through a variable-order Gagliardo-type seminorm and prove…
Programming by demonstration has recently gained much attention due to its user-friendly and natural way to transfer human skills to robots. In order to facilitate the learning of multiple demonstrations and meanwhile generalize to new…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
Boolean satisfiability problem has applications in various fields. An efficient algorithm to solve satisfiability problem can be used to solve many other problems efficiently. The input of satisfiability problem is a finite set of clauses.…
We study semidefinite programming (SDP) relaxations for the NP-hard problem of globally optimizing a quadratic function over the Stiefel manifold. We introduce a strengthened relaxation based on two recent ideas in the literature: (i) a…
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a structure $\mathfrak A$ can be transferred to a classification of…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
The quantified Boolean formula problem (QBF) is a well-known PSpace-complete problem with rich expressive power, and is generally viewed as the SAT analogue for PSpace. Given that many problems today are solved in practice by reducing to…
The notion of the eigenvalue problem in the Fock space with polynomial eigenfunctions is introduced. This problem is classified by using the finite-dimensional representations of the $\mathfrak{sl}(2)$-algebra in Fock space. In the complex…