Pages that link to "Item:Q5061878"
From MaRDI portal
The following pages link to Fine-Grained Time Complexity of Constraint Satisfaction Problems (Q5061878):
Displaying 8 items.
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- 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)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627) (← links)
- On the Subexponential-Time Complexity of CSP (Q5176853) (← links)
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883) (← links)