Pages that link to "Item:Q5061878"
From MaRDI portal
The following pages link to Fine-Grained Time Complexity of Constraint Satisfaction Problems (Q5061878):
Displaying 4 items.
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883) (← links)
