Related papers: Galois correspondence for counting quantifiers
The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In…
We investigate possible quantifications of strictly singular operators, $l_{p}$-strictly singular operators, $c_{0}$-strictly singular operators, strictly cosingular operators, $l_{p}$-strictly cosingular operators. We prove quantitative,…
Quantum entanglement, a cornerstone of quantum mechanics, remains challenging to classify, particularly in multipartite systems. Here, we present a new interpretation of entanglement classification by revealing a profound connection to…
We study a family of problems, called \prob{Maximum Solution}, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean…
A temporal (constraint) language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for temporal constraint…
Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve…
We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem.…
We consider the optimal cloning of quantum coherent states with single-clone and joint fidelity as figures of merit. Both optimal fidelities are attained for phase space translation covariant cloners. Remarkably, the joint fidelity is…
The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, where the goal is to find the number of solutions to a CSP…
Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) $\rho$ have the property that an $n$-ary operation $f$ preserves $\rho$, i.e., $f$ is a polymorphism of $\rho$, if and only if each…
Adjoining to the language of rings the function symbols for splitting coefficients, the function symbols for relative $p$-coordinate functions, and the division predicate for a valuation, some theories of pseudo-algebraically closed…
CSP sparsification, introduced by Kogan and Krauthgamer (ITCS 2015), considers the following question: how much can an instance of a constraint satisfaction problem be sparsified (by retaining a reweighted subset of the constraints) while…
A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \Gamma. We study how hard it is to evaluate this number approximately. There is an…
A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…
We show that there exists a Galois correspondence between subalgebras of an H-comodule algebra A over a base ring R and generalised quotients of a Hopf algebra H. We also show that Q-Galois subextensions are closed elements of the…
This paper introduces a new algorithm for solving a sub-class of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified inequalities on continuous domains. This class of QCSPs has…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…