The following pages link to Victor Dalmau (Q259043):
Displayed 50 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- (Q414931) (redirect page) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- CD(4) has bounded width (Q1047093) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Datalog and constraint satisfaction with infinite templates (Q1936249) (← links)
- A dichotomy theorem for learning quantified Boolean formulas (Q1964325) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Regularizing conjunctive features for classification (Q2662672) (← links)
- (Q2741517) (← links)
- Learning schema mappings (Q2943558) (← links)
- Robust Satisfiability for CSPs (Q2947586) (← links)
- Descriptive Complexity of approximate counting CSPs (Q2958520) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q2986797) (← links)
- Two new homomorphism dualities and lattice operations (Q3103979) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- Beyond Hypertree Width: Decomposition Methods Without Decompositions (Q3524172) (← links)
- Tractable Clones of Polynomials over Semigroups (Q3524174) (← links)
- (Q4495111) (← links)
- Robust algorithms with polynomial loss for near-unanimity CSPs (Q4575759) (← links)
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (Q4635829) (← links)
- (Q4737176) (← links)
- Arc consistency and friends (Q4914413) (← links)
- (Q4955320) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Linear Datalog and Bounded Path Duality of Relational Structures (Q5310636) (← links)
- Generalized Majority-Minority Operations are Tractable (Q5310666) (← links)
- Towards a Characterization of Constant-Factor Approximable Min CSPs (Q5362995) (← links)
- (Q5389980) (← links)
- Computer Science Logic (Q5394580) (← links)
- On the Power of k-Consistency (Q5428816) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431323) (← links)
- Datalog and Constraint Satisfaction with Infinite Templates (Q5449838) (← links)
- Algorithmic Learning Theory (Q5464509) (← links)
- A Simple Algorithm for Mal'tsev Constraints (Q5470744) (← links)
- Theory and Applications of Satisfiability Testing (Q5714774) (← links)
- The Product Homomorphism Problem and Applications (Q5738931) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900293) (← links)