Pages that link to "Item:Q3499775"
From MaRDI portal
The following pages link to Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems (Q3499775):
Displaying 7 items.
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- Approximate Constraint Satisfaction Requires Large LP Relaxations (Q3177811) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801) (← links)