Pages that link to "Item:Q5176025"
From MaRDI portal
The following pages link to The complexity of maximal constraint languages (Q5176025):
Displayed 13 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Basics of Galois Connections (Q5504699) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)