Related papers: The complexity of quantified constraints using the…
In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
Recently the Master Constraint Programme (MCP) for Loop Quantum Gravity (LQG) was launched which replaces the infinite number of Hamiltonian constraints by a single Master constraint. The MCP is designed to overcome the complications…
Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain…
We consider a superintegrable Hamiltonian system in a two-dimensional space with a scalar potential that allows one quadratic and one cubic integral of motion. We construct the most general associative cubic algebra and we present specific…
A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A. A consequence of this demand, called…
In this paper, I consider a fine-grained dichotomy of Boolean counting constraint satisfaction problem (#CSP), under the exponential time hypothesis of counting version (#ETH). Suppose $\mathscr{F}$ is a finite set of algebraic…
In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features.…
Given a noncommutative partial resolution $A=\mathrm{End}_R(R\oplus M)$ of a Gorenstein singularity $R$, we show that the relative singularity category $\Delta_R(A)$ of Kalck-Yang is controlled by a certain connective dga…
We say that a Hopf algebra has the Chevalley property if the tensor product of any two simple modules over this Hopf algebra is semisimple. In this paper we classify finite dimensional triangular Hopf algebras with the Chevalley property,…
We prove a conjecture of J. Carlson, N. Mazza and J. Th\'evenaz; namely, we will prove that if $G$ is a finite $p$-nilpotent group which contains a non-cyclic elementary Abelian $p$-subgroup and $k$ is an algebraically closed field of…
If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of quantum states, this paper shows that NP-complete problems would be efficiently solvable in polynomial time with bounded probability (NP in BQP). With that…
The quantified constraint satisfaction problem (QCSP) is the problem of deciding, given a structure and a first-order prenex sentence whose quantifier-free part is the conjunction of atoms, whether or not the sentence holds on 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…
Let $k$ be an algebraically closed field of characteristic $p>0$, let G=GL_n be the general linear group over $k$, let g=gl_n be its Lie algebra and let $D_s$ be subalgebra of the divided power algebra of g^* spanned by the divided power…
After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if…
We give a complete description of quadratic potential and twisted potential algebras on 3 generators as well as cubic potential and twisted potential algebras on 2 generators up to graded algebra isomorphisms under the assumption that the…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…