The following pages link to Computer Science Logic (Q5292625):
Displaying 12 items.
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Non-binary quantified CSP: Algorithms and modelling (Q1037645) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Solving quantified constraint satisfaction problems (Q2389634) (← links)
- First-Order Model Checking Problems Parameterized by the Model (Q3507457) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- Basics of Galois Connections (Q5504699) (← links)
