Pages that link to "Item:Q5212801"

The following pages link to CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801):

Displaying 4 items.

• CNF satisfiability in a subspace and related problems (Q2093572) (← links)
• Turán numbers of sunflowers (Q5060342) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
• Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)