The following pages link to Enumerating homomorphisms (Q414933):
Displaying 12 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- (Q4549537) (← links)
- ENUMERATION OF HOMOMORPHISMS AND SURFACE-COVERINGS (Q4873869) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)