Pages that link to "Item:Q5868883"
From MaRDI portal
The following pages link to The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883):
Displaying 5 items.
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627) (← links)
- Fine-Grained Time Complexity of Constraint Satisfaction Problems (Q5061878) (← links)
- On the Subexponential-Time Complexity of CSP (Q5176853) (← links)