scientific article; zbMATH DE number 7359806

From MaRDI portal
Publication:4993594

DOI10.4230/DFU.Vol7.15301.1zbMath1482.68161MaRDI QIDQ4993594

Libor Barto, Ross Willard, Andrei A. Krokhin

Publication date: 15 June 2021


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (38)

On a stronger reconstruction notion for monoids and clonesCLAP: A New Algorithm for Promise CSPsTopology and Adjunction in Promise Constraint SatisfactionHomogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)A complexity dichotomy for signed \(\mathbf{H}\)-colouringTowards a characterization of constant-factor approximable finite-valued CSPsPromise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean DichotomyIdeal Membership Problem over 3-Element CSPs with Dual Discriminator PolymorphismUnnamed ItemThe smallest hard treesConstraint satisfaction problem: what makes the problem easyThe Gumm level equals the Alvin level in congruence distributive varietiesThe Complexity of Boolean Surjective General-Valued CSPsProof Complexity Meets AlgebraUnnamed ItemComplexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem𝜔-categorical structures avoiding height 1 identitiesTesting for a semilattice termDECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRASRevisiting alphabet reduction in Dinur’s PCP.Constraint satisfaction problems over semilattice block Mal'tsev algebrasUnnamed ItemUnnamed ItemUnnamed ItemLoop conditionsRobust Algorithms with Polynomial Loss for Near-Unanimity CSPsLoop conditions for strongly connected digraphsGalois connections for patterns: an algebra of labelled graphsThe local loop lemmaAccessible set functors are universalTopology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)Unnamed ItemTesting the Complexity of a Valued CSP LanguageTwo-element structures modulo primitive positive constructabilityThe number of clones determined by disjunctions of unary relationsConstraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial RepresentationsBeyond PCSP (\textbf{1-in-3}, \textbf{NAE})The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation



Cites Work


This page was built for publication: