Pages that link to "Item:Q5111218"
From MaRDI portal
The following pages link to The Complexity of Boolean Surjective General-Valued CSPs (Q5111218):
Displaying 4 items.
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5205805) (← links)