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 35 items.

• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
• Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
• (Q5743434) (← links)
• (Q5863609) (← links)
• (Q5863854) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
• Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
• Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
• The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
• Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
• Generalized satisfiability problems via operator assignments (Q5919560) (← links)
• Fanout limitations on constraint systems (Q5941073) (← links)
• The smallest hard trees (Q6073305) (← links)
• Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
• Monoidal Width: Capturing Rank Width (Q6150162) (← links)
• Surjective polymorphisms of directed reflexive cycles (Q6183437) (← links)
• (Q6185533) (← links)
• Reasoning on property graphs with graph generating dependencies (Q6554875) (← links)
• Generalisations of matrix partitions: complexity and obstructions (Q6564025) (← links)
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
• Conditional dichotomy of Boolean ordered promise CSPs (Q6566587) (← links)
• On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
• Functors on relational structures which admit both left and right adjoints (Q6573001) (← links)
• Gyro-groups, gyro-splittings and co-homology (Q6601864) (← links)
• Constraint reasoning (Q6602253) (← links)
• Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
• Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
• Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)
• Finite algebras with Hom-sets of polynomial size (Q6653796) (← links)
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)
• Forbidden tournaments and the orientation completion problem (Q6668354) (← links)