Pages that link to "Item:Q4210136"

The following pages link to The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (Q4210136):

Displaying 50 items.

• When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
• Satisfiability in MultiValued Circuits (Q5080482) (← links)
• (Q5089260) (← links)
• Adventures in monotone complexity and TFNP (Q5090415) (← links)
• (Q5090503) (← links)
• Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
• (Q5091214) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• (Q5091252) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5092423) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
• The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
• (Q5111249) (← links)
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
• (Q5136286) (← links)
• The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
• Solving equation systems in ω-categorical algebras (Q5163170) (← links)
• Tractability of quantified temporal constraints to the max (Q5175605) (← links)
• Weak classification of finite groups (Q5178360) (← links)
• Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
• Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
• Homomorphisms of Signed Graphs (Q5265329) (← links)
• Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
• (Q5377468) (← links)
• (Q5381121) (← links)
• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5386972) (← links)
• Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
• A Generalized Version of the Baker–Pixley Theorem (Q5412097) (← links)
• THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM (Q5461667) (← links)
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5483456) (← links)
• Topological Birkhoff (Q5496670) (← links)
• Twisted Automorphisms and Twisted Right Gyrogroups (Q5501071) (← links)
• Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
• Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)